.png){kind=icon}
.png){kind=icon}
Return
A note on a modified simplex approach for solving bilevel linear programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00297-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We analyze the article A modified simplex approach for solving bilevel linear programming problems (EJOR, 67, 116-135). 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. (C) 2000 Elsevier Science B.V. All rights reserved.
Keywords:
bilevel linear programming
local and global optima
penalty methods
simplex method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available