A study of local solutions in linear bilevel programming
From MaRDI portal
Publication:1781863
DOI10.1007/S10957-004-1711-9zbMATH Open1114.90108OpenAlexW2069461775MaRDI QIDQ1781863FDOQ1781863
Authors: Manoel Campêlo, Susana Scheimberg 
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
Recommendations
- A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
- Theoretical and computational results for a linear bilevel problem
- scientific article; zbMATH DE number 2052985
- Numerical solution of a linear bilevel problem
- A computational study of global algorithms for linear bilevel programming
Cites Work
- Bilevel and multilevel programming: A bibliography review
- New Branch-and-Bound Rules for Linear Bilevel Programming
- A penalty function approach for solving bi-level linear programs
- Multilevel optimization: algorithms and applications
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- A cutting plane algorithm for solving bilinear programs
- Two-Level Linear Programming
- A sequential LCP method for bilevel linear programming
- A symmetrical linear maxmin approach to disjoint bilinear programming
- On the structure and properties of a linear multilevel programming problem
- Generating Linear and Linear-Quadratic Bilevel Programming Problems
- Exact penalty for mathematical programs with linear complementarity constraints
- A modified simplex approach for solving bilevel linear programming problems
Cited In (8)
- A review of recent advances in global optimization
- Local statements on dual methods in problems of multilevel optimization
- A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
- Theoretical and computational results for a linear bilevel problem
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Penalty method-based equilibrium point approach for solving the linear bilevel multiobjective programming problem
- A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
- Exact penalty method for the nonlinear bilevel programming problem
This page was built for publication: A study of local solutions in linear bilevel programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781863)
