Premium
Generalized geometric programming with many equality constraints
Author(s) -
Burns Scott A.
Publication year - 1987
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620240406
Subject(s) - monomial , mathematics , geometric programming , regular polygon , mathematical optimization , inequality , cutting plane method , space (punctuation) , convex optimization , feasible region , algebra over a field , computer science , pure mathematics , integer programming , mathematical analysis , geometry , operating system
A monomial treatment for solving mixed equality/inequality constrained generalized geometric programs is presented. The method is shown to be equivalent to a Newton–Raphson procedure carried out in log space on the equality constraints at the same time that a cutting plane procedure is performed on a convex region constrained within the feasible region of the inequality constraints. Known limitations of this monomial treatment are outlined and a technique for improving the efficiency of the GGP method is suggested. A discussion of how other methods of solving mixed equality/inequality constrained GGP problems compare to the monomial treatment is presented and two example problems are solved.