DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
Accession Number:
AD0735474
Title:
On a Classification Scheme for Geometric Programming and Complementarity Theorems.
Descriptive Note:
Research rept.,
Corporate Author:
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Report Date:
1971-10-01
Pagination or Media Count:
25.0
Abstract:
A classification theorem for geometric programming is given by using the duality results of Duffin-Peterson-Zener and two properties of a given pair of dual geometric programming problems having subconsistent primal 1 if the subinfimum is 0, then the dual is inconsistent and 2 if the subinfimum is infinity then the dual is consistent and unbounded. While 1 and 2 may be derived as corollaries to the Duffin-Peterson-Zener theorems, the authors derivation leads to new complementarity theorems for subconsistent not necessarily consistent primal problems. Author
Distribution Statement:
APPROVED FOR PUBLIC RELEASE