ON SUBOPTIMIZATION: AN EXAMPLE

reportActive / Technical Report | Accession Number: AD0669291 | Open PDF

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.

Author(s):
Danskin, J. M.
Author Organization(s):
CENTER FOR NAVAL ANALYSES ALEXANDRIA VA
Descriptive Note:
Final rept.
Supplementary Note:
DOI: 10.21236/AD0669291
Pagination:
0010

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
CNA-RESEARCH CONTRIBUTION-22
Contract/Grant Number(s):
NONR-3732(00)
Monitor Series:
ONR
 Subject Terms
Joint Capability Areas:
JCA_5.3_Planning; JCA_5_Command and Control; JCA_6.4.1_Secure Information Exchange; JCA_6.4_Information Assurance; JCA_6_Net Centric
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*OPTIMIZATION, ECONOMICS, PROBLEM SOLVING, OPERATIONS RESEARCH, NUMERICAL METHODS AND PROCEDURES, EXPONENTIAL FUNCTIONS, GAME THEORY
Field(s)/Group(s):
Operations Research
Keyword(s):
ALLOCATION PROCESSES
Report Date:
1966 Jun 17