On a Dynamic Programming Approach to the Caterer Problem—I

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.

• 저널Management Science · 3(3) · 270–278
• 토픽Advanced Bandit Algorithms Research · Management Science and Operations Research
• DOI10.1287/mnsc.3.3.270
• 저자Richard Bellman