ON SUBOPTIMIZATION: AN EXAMPLE

Abstract

In certain allocation problems concerning groups of systems, it is possible to allocate by allocating within each system and then combining the results. This paper shows that while this method is correct for pure maximum problems and for cases in which the overall problem is a game, it is not true for Max-Min problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 17, 1966
Accession Number
AD0669291

Entities

People

  • J. M. Danskin

Organizations

  • Center for Naval Analyses

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Classification
  • Commerce
  • Contractors
  • Contracts
  • Military Research
  • New York
  • Operations Research
  • Security

Readers

  • Game Theory.
  • Graph Algorithms and Convex Optimization.
  • Logistics and Supply Chain Management.