Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
From MaRDI portal
Publication:757251
DOI10.1016/0307-904X(90)90018-ZzbMATH Open0722.90061MaRDI QIDQ757251FDOQ757251
Publication date: 1990
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Recommendations
- A new global optimization algorithm for solving generalized geometric programming
- scientific article; zbMATH DE number 1895618
- scientific article; zbMATH DE number 1163114
- A new two-level linear relaxed bound method for geometric programming problems
- A new linear relaxed method for solving generalized geometric programming
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Title not available (Why is that?)
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- Optimality conditions for the bilevel programming problem
- On two-level optimization
- Two-Level Linear Programming
- Title not available (Why is that?)
- An Algorithm for Solving the General Bilevel Programming Problem
- A linear max—min problem
- Geometric Programming: Methods, Computations and Applications
- Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
- Derivative evaluation and computational experience with large bilevel mathematical programs
- Dual to primal conversion in geometric programming
Cited In (4)
This page was built for publication: Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757251)
