COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 3. SOME PRIMAL AND DUAL ALGORITHMS FOR POSYNOMIAL AND SIGNOMIAL GEOMETRIC PROGRAMS

In this paper we consider algorithmic and computational aspects of selected methods for posynomial and signomial programming problems. In particular, we consider the modified concave simplex method for dual posynomial programs and discuss some recent developments suggesting a new dual algorithm. We also consider linear programming based algorithms for primal posynomial programs. Finally, we discuss a recently developed branch and bound method for signomial programming.

[1]  Yves Smeers,et al.  On the use of linear programs to solve prototype geometric programs , 1974 .

[2]  Y. Smeers,et al.  A modified reduced gradient method for dual posynomial programming , 1978 .

[3]  J. Ecker,et al.  A modified concave simplex algorithm for geometric programming , 1975 .

[4]  R. S. Dembo.  Current state of the art of algorithms and computer software for geometric programming , 1977 .

[5]  Gary A. Kochenberger,et al.  Computational aspects of cutting-plane algorithms for geometric programming problems , 1977, Math. Program..

[6]  R. A. Cuninghame-Green,et al.  Applied geometric programming , 1976 .

[7]  Jack Elzinga,et al.  A central cutting plane algorithm for the convex programming problem , 1975, Math. Program..

[8]  Joseph G. Ecker,et al.  An Easy Primal Method for Geometric Programming , 1976 .

[9]  M. J. Rijckaert,et al.  A condensation method for generalized geometric programming , 1976, Math. Program..

[10]  Richard James Duffin,et al.  The proximity of (algebraic) geometric programming to linear programming , 1972, Math. Program..

[11]  R. Duffin.  Linearizing Geometric Programs , 1970 .

[12]  R. Dembo,et al.  Solution of Generalized Geometric Programs , 1975 .

[13]  J. E. Falk,et al.  An Algorithm for Separable Nonconvex Programming Problems , 1969 .

[14]  Clarence Zener,et al.  Geometric Programming : Theory and Application , 1967 .

[15]  R. Duffin,et al.  Geometric programming with signomials , 1973 .

[16]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[17]  Yves Smeers,et al.  Reversed geometric programming: A branch-and-bound method involving linear subproblems , 1980 .

[18]  Leon S. Lasdon,et al.  Nonlinear optimization using the generalized reduced gradient method , 1974 .

[19]  Willy Gochet,et al.  Computational results with a branch and bound method for reversed geometric programs , 1977 .

[20]  X. M. Martens,et al.  Comparison of Generalized Geometric Programming Algorithms , 1978 .

[21]  Mordecai Avriel,et al.  Complementary Geometric Programming , 1970 .

[22]  B. Eaves,et al.  Generalized Cutting Plane Algorithms , 1971 .

[23]  Willard I. Zangwill,et al.  The Convex Simplex Method , 1967 .

[24]  M. J. Rijckaert.  Computational aspects of geometric programming , 1977 .