Reformulation of bilevel linear fractional/linear programming problem into a mixed integer programming problem via complementarity problem
by Anuradha Sharma
International Journal of Computing Science and Mathematics (IJCSM), Vol. 15, No. 4, 2022

Abstract: The bilevel programming problem is a static version of the Stackelberg's leader follower game in which Stackelberg strategy is used by the higher level decision maker called the leader given the rational reaction of the lower decision maker called the follower. The bilevel programming problem (BLPP) is a two-level hierarchical optimisation problem and is non-convex. This paper deals with finding links between the bilevel linear fractional/linear programming problem (BF/LP), the generalised linear fractional complementarity problem (GFCP) and mixed integer linear fractional programming problem (MIFP). The (BF/LP) is reformulated as a (GFCP) which in turn is reformulated as an (MIFP). The method is supported with the help of a numerical example.

Online publication date: Tue, 04-Oct-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com