On a Classification Theorem for Geometric Programming.
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Pagination or Media Count:
A new classification theorem for geometric programming is developed using known duality Theorems of Duffin-Peterson-Zenner and two new Theorems. The first theorem is related to totally degenerate problems and the second deals with subconsistent problems which are unbounded, and thereby new results are derived for non-canonical programs. Author
- Operations Research