ON A DYNAMIC PROGRAMMING APPROACH TO THE CATERER PROBLEM 1

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 17, 1956
Accession Number
AD0605043

Entities

People

  • Richard E. Bellman

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Dynamic Programming
  • Economics
  • Equations
  • Hard Copy
  • Logistics
  • Mathematics
  • Microfiche
  • Photographic Materials
  • Photography
  • Sequences

Fields of Study

  • Mathematics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Military History
  • Systems Analysis and Design