Linear bilevel problems: genericity results and an efficient method for computing local minima
From MaRDI portal
Publication:1397066
DOI10.1007/s001860200189zbMath1115.90364OpenAlexW2138679643MaRDI QIDQ1397066
Publication date: 16 July 2003
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/linear-bilevel-problems-genericity-results-and-an-efficient-method-for-computing-local-minima(7fc82e9c-1913-481c-bb1d-b1ea15602b73).html
Related Items (6)
A survey on mixed-integer programming techniques in bilevel optimization ⋮ Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm ⋮ Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method ⋮ On generalized semi-infinite optimization and bilevel optimization ⋮ Equilibrium constrained optimization problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
This page was built for publication: Linear bilevel problems: genericity results and an efficient method for computing local minima
