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

DOI10.1016/S0377-2217(99)00297-0zbMATH Open0970.90048MaRDI QIDQ1584801FDOQ1584801

Authors: Susana Scheimberg, Manoel Campêlo 

Publication date: 5 November 2000

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

Recommendations

• A modified simplex approach for solving bilevel linear programming problems
• A method for solving bilevel linear programming problems
• A linear bilevel programming algorithm: A comment
• A note on a linear bilevel programming algorithm based on bicriteria programming
• A note on a penalty function approach for solving bilevel linear programs

zbMATH Keywords

penalty methodsbilevel linear programmingsimplex methodlocal and global optima

Mathematics Subject Classification ID

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

Cites Work

• A modified simplex approach for solving bilevel linear programming problems

Cited In (11)

• A note on `bilevel linear fractional programming problem'.
• A pivoting algorithm for linear programming with linear complementarity constraints
• Title not available (Why is that?)
• A note on a paper by Molai and Khorram
• A note on linearized reformulations for a class of bilevel linear integer problems
• A method for solving bilevel linear programming problems
• A note on a penalty function approach for solving bilevel linear programs
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
• A fuzzy approach for bi-level integer non-linear programming problem
• An update on bi-level geometric programming: A new optimization model
• A Note on: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem

Uses Software

• GAMS
• MINOS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584801)