Author(s)

Rashmi Birla¹, Vijay K. Agarwal², Idrees A. Khan³, Vishnu Narayan Mishra^4*

¹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.

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.

Linear Programming Problem, Bi-Level Programming Problem, Graph, Algorithm

Birla, R. , Agarwal, V. , Khan, I. and Mishra, V. (2017) An Alternative Approach for Solving Bi-Level Programming Problems. American Journal of Operations Research, 7, 239-247. doi: 10.4236/ajor.2017.73016.