NOTES IN THE THEORY OF DYNAMIC PROGRAMMING. II: A FUNCTIONAL EQUATION ARISING IN ALLOCATION THEORY

Abstract

The structure of the solution of f(x) = Max (0<y<x) (g(y)+h(x-y) +f(ay+b(x-y))), in the case where g and h are concave is derived.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 25, 1955
Accession Number
AD0604633

Entities

People

  • Richard E. Bellman

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Computer Programming
  • Convergence
  • Dynamic Programming
  • Equations
  • Hard Copy
  • Inequalities
  • Intervals
  • Mathematics
  • Microfiche
  • Personality
  • Sequences