A Branch-and-Bound Method for Reversed Geometric Programming

Willy Gochet and Yves Smeers
Additional contact information
Willy Gochet: CORE, Louvain-La Neuve, Belgium
Yves Smeers: CORE, Louvain-La Neuve, Belgium

Operations Research, 1979, vol. 27, issue 5, 982-996

Abstract: A general or signomial geometric program is a nonlinear mathematical program involving general polynomials in several variables both in the objective function and the constraints. A branch-and-bound method is proposed for this extensive class of nonconvex optimization programs guaranteeing convergence to the global optimum. The subproblems to be solved are convex but the method can easily be combined with a cutting plane technique to generate subproblems which are linear. A simple example is given to illustrate the technique. The combined method involving linear subproblems has been coded and numerical experience with this code will be reported later.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.5.982 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:27:y:1979:i:5:p:982-996

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().