An Alternative Approach for Solving Bi-Level Programming Problems

作     者：Rashmi Birla Vijay K. Agarwal Idrees A. Khan Vishnu Narayan Mishra 

作者机构：Department of Mathematics Sir Padampat Singhania University Bhatewar India Department of Mathematics Mody University of Science and Techonology Lakshmangarh India Department of Mathematics Integral University Lucknow India Applied Mathematics & Humanities Department Sardar Vallabhbhai National Institute of Technology Surat India 

出 版 物：《American Journal of Operations Research》 (美国运筹学期刊（英文）)

年 卷 期：2017年第7卷第3期

页      面：239-247页

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：Linear Programming Problem Bi-Level Programming Problem Graph Algorithm 

摘      要：An algorithm is proposed in this paper for solving two-dimensional bi-level linear programming problems without making a graph. Based on the classification of constraints, algorithm removes all redundant constraints, which eliminate the possibility of cycling and the solution of the problem is reached in a finite number of steps. Example to illustrate the method is also included in the paper.