Geometric Programming via a Primal Auxiliary Problem
- 1 December 1974
- journal article
- research article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 6 (4) , 308-317
- https://doi.org/10.1080/05695557408974969
Abstract
This paper suggests the solution of geometric programs with degrees of difficulty by means of an auxiliary problem which is the reduced equivalent of the primal problem. The auxiliary problem is derived from the primal program by direct algebraic transformation and has a highly simplified convex separable structure. Using a condensation technique introduced by Duffin, it is shown that generalized polynomial programs can be solved via a sequence of approximating problems with a similar convex separable structure.Keywords
This publication has 5 references indexed in Scilit:
- Complementary Geometric ProgrammingSIAM Journal on Applied Mathematics, 1970
- Linearizing Geometric ProgramsSIAM Review, 1970
- Generalized Polynomial OptimizationSIAM Journal on Applied Mathematics, 1967
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraintsJournal of Mathematical Analysis and Applications, 1967
- A generalized inverse for matricesMathematical Proceedings of the Cambridge Philosophical Society, 1955