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 Sokolowsky, Prager, can be reduced to of determining maximum linear form, subject series “triangular” constraints form inequalities, under an assumption concerning non-accumulation dirty laundry. This maximization solved explicitly, using functional equation technique dynamic programming.