Reversed geometric programming: A branch-and-bound method involving linear subproblems

DOI10.1016/0377-2217(80)90070-3zbMath0436.90098OpenAlexW1974138128MaRDI QIDQ1141082

Willy Gochet, J. G. Ecker, F. Cole, F. Van Assche, Yves Smeers

Publication date: 1980

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(80)90070-3

zbMATH Keywords

global optimizationglobal solutionbranch-and-bound methodcutting plane algorithmlinear subproblemscomputational evidencegeneral polynomial programsreversed geometric programmingreversed posynomial program

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (3)

A new two-level linear relaxed bound method for geometric programming problems ⋮ Duality of a nonconvex sum of ratios ⋮ A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global solutions of mathematical programs with intrinsically concave functions
• Constrained derivatives and equilibrium conditions in generalized geometric programming
• Geometric programming with signomials
• A modified reduced gradient method for a class of nondifferentiable problems
• Solution of generalized geometric programs
• An Easy Primal Method for Geometric Programming
• A set of geometric programming test problems and their solutions
• An Algorithm for Separable Nonconvex Programming Problems

This page was built for publication: Reversed geometric programming: A branch-and-bound method involving linear subproblems