A note on a modified simplex approach for solving bilevel linear programming problems

DOI10.1016/S0377-2217(99)00297-0zbMath0970.90048MaRDI QIDQ1584801

Susana Scheimberg, Manoel B. Campêlo

Publication date: 5 November 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

simplex methodpenalty methodsbilevel linear programminglocal and global optima

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items (5)

A pivoting algorithm for linear programming with linear complementarity constraints ⋮ A fuzzy approach for bi-level integer non-linear programming problem ⋮ A note on linearized reformulations for a class of bilevel linear integer problems ⋮ A method for solving bilevel linear programming problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

• GAMS
• MINOS

Cites Work

• A modified simplex approach for solving bilevel linear programming problems

This page was built for publication: A note on a modified simplex approach for solving bilevel linear programming problems