On a Dynamic Programming Approach to the Caterer Problem--I

Richard Bellman
Additional contact information
Richard Bellman: The RAND Corporation

Management Science, 1957, vol. 3, issue 3, 270-278

Abstract: In this paper, it is shown that the "caterer" problem, a problem in mathematical economics and logistics which has been discussed by Jacobs, Gaddum, Hoffman and Sokolowsky, and Prager, can be reduced to the problem of determining the maximum of the linear form, subject to a series of "triangular" constraints in the form of inequalities, under an assumption concerning the non-accumulation of dirty laundry. This maximization problem is solved explicitly, using the functional equation technique of dynamic programming.

Date: 1957
References: Add references at CitEc
Citations: View citations in EconPapers (385)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.3.3.270 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:3:y:1957:i:3:p:270-278

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().