A computational study of global algorithms for linear bilevel programming
The authors analyse two global algorithms for solving the linear bilevel programming problem of the form \(\max_{x,y}\, c^T_1 x+ c^T_2y\) s.t. \(B_1x+ B_2y\leq b\), \(x\geq 0\) where \(y\) solves: \(\max_y\, d^Ty\) s.t. \(A_1x+ A_2y\leq a\), \(y\geq 0\). The first one is a recent algorithm built on a new concept of equilibrium point and a modified version of the outer approximation method. The second one is an efficient branch-and-bound algorithm. Based on computational results, some modification in both algorithms are proposed.
- scientific article; zbMATH DE number 1145365
- scientific article; zbMATH DE number 817607
- A global optimization method for solving the linear semivectorial bilevel programming problem
- Global optimization of nonlinear bilevel programming problems
- A globally convergent algorithm for a class of bilevel nonlinear programming problem
- A global optimization method for a class of nonlinear bilevel integer programming
- Global solution of bilevel programming problems
- A method for a -global optimal solution of linear bilevel programming
- Global optimization algorithm for solving bilevel programming problems with quadratic lower levels
- A global convergent method for nonlinear bilevel programming problems
- Solving bilevel linear programs using multiple objective linear programming
- A note on a linear bilevel programming algorithm based on bicriteria programming
- Linear bilevel problems: genericity results and an efficient method for computing local minima
- Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function
- A differential evolution with two mutation strategies and a selection based on an improved constraint-handling technique for bilevel programming problems
- A study of local solutions in linear bilevel programming
- Algorithms for linear programming with linear complementarity constraints
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- Theoretical and computational results for a linear bilevel problem
- Numerical solution of a linear bilevel problem
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- scientific article; zbMATH DE number 35514 (Why is no real title available?)
- scientific article; zbMATH DE number 1264394 (Why is no real title available?)
- scientific article; zbMATH DE number 1145365 (Why is no real title available?)
- scientific article; zbMATH DE number 1783875 (Why is no real title available?)
- On a solving bilevel d.c.-convex optimization problems
- Global search for bilevel optimization with quadratic data
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Extreme points algorithm for solving bilevel linear programming
- scientific article; zbMATH DE number 970346 (Why is no real title available?)
- A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
- A review of recent advances in global optimization
- An extended branch and bound algorithm for linear bilevel programming
This page was built for publication: A computational study of global algorithms for linear bilevel programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596661)
