
Accession Number : AD0735474
Title : On a Classification Scheme for Geometric Programming and Complementarity Theorems.
Descriptive Note : Research rept.,
Corporate Author : CARNEGIEMELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Personal Author(s) : Gochet,W. ; Kortanek,K. O. ; Smeers,Y.
Report Date : OCT 1971
Pagination or Media Count : 25
Abstract : A classification theorem for geometric programming is given by using the duality results of DuffinPetersonZener 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 DuffinPetersonZener theorems, the authors derivation leads to new complementarity theorems for subconsistent (not necessarily consistent) primal problems. (Author)
Descriptors : (*MATHEMATICAL PROGRAMMING, CLASSIFICATION), GEOMETRY, SEQUENCES, INEQUALITIES, THEOREMS
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE