Accession Number:

AD0605043

Title:

ON A DYNAMIC PROGRAMMING APPROACH TO THE CATERER PROBLEM 1

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CA

Personal Author(s):

Report Date:

1956-05-17

Pagination or Media Count:

19.0

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 a linear form subject to a series of constraints. This maximization problem is solved explicitly, using the functional equation technique of dynamic programming.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE