DYNAMIC PROGRAMMING IN MULTIPLICATIVE LATTICES,

Abstract

This Memorandum demonstrates that the methods of dynamic programming may be applied to problems involving partially ordered criterion functions; specifically, the existence of optimal policies and the principle of optimality are established for a category of problems in which the criterion space is a conditionally complete multiplicative lattice. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1964
Accession Number
AD0604855

Entities

People

  • R. E. Strauch
  • T. A. Brown

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Computing-Related Activities
  • Dynamic Programming
  • Interdisciplinary Science
  • Mathematical Programming
  • Mathematics
  • Operations Research

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Regression Analysis.

Technology Areas

  • Space