POLYNOMIAL APPROXIMATION. A NEW COMPUTATIONAL TECHNIQUE IN DYNAMIC PROGRAMMING. I. ALLOCATION PROCESSES

Abstract

The application of the simple yet powerful computational technique of polynomial approximation to problems in dynamic programming is initiated. The theoretical applicability of orthogonal polynomials is discussed and then applied to oneand two-dimensional allocation problems. Numerical results obtained from FORTRAN programs involving Legendre polynomals are presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1962
Accession Number
AD0275312

Entities

People

  • Bella Kotkin
  • Richard E. Bellman
  • Robert E. Kalaba

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Accuracy
  • Agreements
  • Algorithms
  • Coefficients
  • Computations
  • Computer Programming
  • Computers
  • Dynamic Programming
  • Equations
  • Four Dimensional
  • Government Procurement
  • Governments
  • Intervals
  • New Jersey
  • Polynomials
  • Sequences
  • Two Dimensional

Readers

  • Calculus or Mathematical Analysis
  • Computer Science.