Accession Number:

AD0755263

Title:

A Fixed Point Theorem from Dynamic Programming.

Descriptive Note:

Technical rept.,

Corporate Author:

STANFORD UNIV CALIF DEPT OF OPERATIONS RESEARCH

Personal Author(s):

Report Date:

1973-01-01

Pagination or Media Count:

28.0

Abstract:

An algorithm is described for solving the fixed point problem y max delta P sub deltay R sub delta under new conditions. The algorithm resembles Lemkes complementary pivoting scheme for quadratic programming and bimatrix games, Howards policy improvement scheme for dynamic programming, and Newtons method for solving systems of equations. Author

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE