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

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

0.00 Avg rating0 Votes
Article ID: iaor20012032
Country: Netherlands
Volume: 126
Issue: 2
Start Page Number: 454
End Page Number: 458
Publication Date: Oct 2000
Journal: European Journal of Operational Research
Authors: ,
Keywords: bilevel optimization
Abstract:

We analyze the article ‘A modified simplex approach for solving bilevel linear programming problems’. We point out some problems in its theoretical analysis. Moreover, the algorithm proposed may not find a global solution as it is claimed. We give some examples in order to illustrate these remarks.

Reviews

Required fields are marked *. Your email address will not be published.