Research Article Open Access

A PROCEDURE FOR SOLVING INTEGER BILEVEL LINEAR PROGRAMMING PROBLEMS

Abstract

This paper is an extension of the K th-best approach [4] for solving bilevel linear programming problems with integer variables. NAZ cut [2] and A-T cut [3] are added to reach the integer optimum. An example is given to show the efficiency of the proposed algorithm.

A.Y. Adhami, and Quazzafi Rabbani

To read the full article Download Full Article | Visit Full Article