An update on bi-level geometric programming: A new optimization model

DOI10.1016/0307-904X(93)90110-3zbMATH Open0774.90066MaRDI QIDQ1801971FDOQ1801971

Authors: Richard S. Segall 

Publication date: 14 November 1993

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

Recommendations

• Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
• A new algorithm for geometric programming based on the linear structure of its dual problem.
• Comments on: ``A note on the paper ``Optimality conditions for optimistic bilevel programming problem using convexifactors
• A note on a modified simplex approach for solving bilevel linear programming problems
• New solutions to a special class of nonlinear bi-level programming problem

zbMATH Keywords

branch-and-boundbi-level geometric programming

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Optimality conditions for the bilevel programming problem
• Title not available (Why is that?)
• An Algorithm for Solving the General Bilevel Programming Problem
• Geometric Programming: Methods, Computations and Applications
• Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
• A note on the optimality conditions for the bilevel programming problem

Cited In (1)

• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

This page was built for publication: An update on bi-level geometric programming: A new optimization model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801971)