On the bilevel integer linear fractional programming problem

On the bilevel integer linear fractional programming problem

0.00 Avg rating0 Votes
Article ID: iaor20022525
Country: India
Volume: 38
Issue: 5
Start Page Number: 508
End Page Number: 519
Publication Date: Oct 2001
Journal: OPSEARCH
Authors: ,
Keywords: programming: linear
Abstract:

The bilevel programming problem is a leader–follower game in which two players try to maximize their own objective function over a common feasible region. In this paper we consider the bilevel programming problem in which both the objective functions are linear fractional and the variables take non-negative integral values. An algorithm to find the optimal integer solution is developed. The search is made among bases of the coefficient submatrix corresponding to the variables controlled by the follower's problem. An example to demonstrate the algorithm is presented.

Reviews

Required fields are marked *. Your email address will not be published.