Skip to main content
SpringerLink
Log in

A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, primal and dual cutting plane algorithms for the solution of posynomial geometric programming problems are presented. It is shown that these cuts are deepest, in the sense that they cut off as much of the infeasible set as possible. Problems of nondifferentiability in the dual cutting plane are circumvented by the use of a subgradient. Although the resulting dual problem seems easier to solve, the computational experience seems to show that the primal cutting plane outperforms the dual.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Kelley, J. E.,The Cutting Plane Method for Solving Convex Programs, SIAM Journal on Applied Mathematics, Vol. 8, No. 4, 1960.

  2. Duffin, R. E., Peterson, E., andZener, C.,Geometric Programming, Wiley, New York, New York, 1967.

    Google Scholar 

  3. Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

    Google Scholar 

  4. Avriel, M.,Nonlinear Programming: Analysis and Methods, Prentice-Hall, Englewood Cliffs, New Jersey, 1976.

    Google Scholar 

  5. Cole, F., Gochet, W., Van Assche, F., Ecker, J., andSmeers, Y.,Reversed Geometric Programming: A Branch-and-Bound Method Involving Linear Subproblems, European Journal of Operations Research, Vol. 5, No. 1, 1980.

  6. Gochet, W., andSmeers, Y.,On the Use of Linear Programs to Solve Prototype Geometric Programs, Cahiers du Centre d'Etudes de Recherche Opérationnelle, Vol. 16, No. 1, 1974.

  7. Beck, P., andEcker, J.,A Modified Concave Simplex Algorithms for Geometric Programming, Journal of Optimization Theory and Applications, Vol. 15, No. 2, 1975.

  8. Ecker, J., Gochet, W., andSmeers, Y.,A Modified Reduced Gradient Method for Dual Posynomial Programming, Journal of Optimization Theory and Applications, Vol. 26, No. 2, 1978.

  9. Beightler, C., andPhillips, D.,Applied Geometric Programming, Wiley, New York, New York, 1976.

    Google Scholar 

  10. Beck, P., andEcker, J.,Some Computational Experience with a Modified Convex Simplex Algorithm for Geometric Programming, USAF, Report No. ADIC-72-20, 1972.

Download references

Author information

Authors and Affiliations

  1. Sint-Aloyisius Handelshogeschool, Brussels, Belgium

    F. Cole (Associate Professor)

  2. Department of Applied Economics, Catholic University of Louvain, Leuven, Belgium

    W. Gochet (Professor)

  3. Center for Operations Research and Econometrics and Department of Industrial Engineering, Université Catholique de Louvain, Louvain-la-Neuve, Belgium

    Y. Smeer (Professor)

Authors
  1. F. Cole
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. Gochet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Y. Smeer
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by M. Avriel

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cole, F., Gochet, W. & Smeer, Y. A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems. J Optim Theory Appl 47, 159–180 (1985). https://doi.org/10.1007/BF00940767

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00940767

Key Words

Search

Navigation