A study of local solutions in linear bilevel programming
From MaRDI portal
Publication:1781863
DOI10.1007/s10957-004-1711-9zbMath1114.90108OpenAlexW2069461775MaRDI QIDQ1781863
Susana Scheimberg, Manoel B. Campêlo
Publication date: 9 June 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-004-1711-9
Related Items (6)
A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming ⋮ A review of recent advances in global optimization ⋮ Penalty method-based equilibrium point approach for solving the linear bilevel multiobjective programming problem ⋮ Exact penalty method for the nonlinear bilevel programming problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
Cites Work
- On the structure and properties of a linear multilevel programming problem
- A sequential LCP method for bilevel linear programming
- A modified simplex approach for solving bilevel linear programming problems
- A penalty function approach for solving bi-level linear programs
- Bilevel and multilevel programming: A bibliography review
- Multilevel optimization: algorithms and applications
- A symmetrical linear maxmin approach to disjoint bilinear programming
- An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- Generating Linear and Linear-Quadratic Bilevel Programming Problems
- New Branch-and-Bound Rules for Linear Bilevel Programming
- A cutting plane algorithm for solving bilinear programs
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Exact penalty for mathematical programs with linear complementarity constraints
- Two-Level Linear Programming
This page was built for publication: A study of local solutions in linear bilevel programming
