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

作     者：Campêlo, M Scheimberg, S 

作者机构：Fed Univ Rio De Janeiro COPPE Sistemas Inst Matemat BR-21945970 Rio De Janeiro Brazil Univ Fed Ceara Dept Estat & Mat Aplicada BR-60455760 Fortaleza Ceara Brazil 

出 版 物：《EUROPEAN JOURNAL OF OPERATIONAL RESEARCH》 (欧洲运筹学杂志)

年 卷 期：2000年第126卷第2期

页      面：454-458页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Conselho Nacional de Desenvolvimento Científico e Tecnológico, CNPq PICDT-CAPES 

主　　题：bilevel linear programming local and global optima penalty methods simplex method 

摘      要：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.