Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
type: Item
instance of: scholarly article
title: Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
zbMATH Open document ID: 0722.90061
DOI: 10.1016/0307-904X(90)90018-Z
published in: Applied Mathematical Modelling
publication date: 1990-01-01T00:00:00Z
review text: This paper presents a new linear optimization model that is both geometric and bilevel. After giving the definitions, optimality conditions and an algorithm based on the method of branch-and-bound to implicitly enumerate all the combinations for the complementary slackness conditions are derived.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 4191410
zbMATH Keywords: multilevel mathematical programming
zbMATH Keywords: branch-and-bound
author: Richard S. Segall
reviewed by: Constantin Udrişte
MaRDI profile type: Publication
cites work: A linear max—min problem
cites work: An Algorithm for Solving the General Bilevel Programming Problem
cites work: Optimality conditions for the bilevel programming problem
cites work: On two-level optimization
cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem
cites work: Two-Level Linear Programming
cites work: Q5588268
cites work: Derivative evaluation and computational experience with large bilevel mathematical programs
cites work: Q5557595
cites work: Dual to primal conversion in geometric programming
cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem
cites work: Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
cites work: Geometric Programming: Methods, Computations and Applications
description: scientific article; zbMATH DE number 4191410