Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model

DOI10.1016/0307-904X(90)90018-ZzbMath0722.90061MaRDI QIDQ757251

Richard S. Segall

Publication date: 1990

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundmultilevel mathematical programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

An update on bi-level geometric programming: A new optimization model ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• Derivative evaluation and computational experience with large bilevel mathematical programs
• Dual to primal conversion in geometric programming
• Optimality conditions for the bilevel programming problem
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• An Algorithm for Solving the General Bilevel Programming Problem
• Geometric Programming: Methods, Computations and Applications
• A Representation and Economic Interpretation of a Two-Level Programming Problem
• On two-level optimization
• A linear max—min problem
• Two-Level Linear Programming
• Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems