An algorithm to solve linear fractional bilevel programming problem via goal programming

An algorithm to solve linear fractional bilevel programming problem via goal programming

0.00 Avg rating0 Votes
Article ID: iaor20011512
Country: India
Volume: 37
Issue: 1
Start Page Number: 1
End Page Number: 13
Publication Date: Mar 2000
Journal: OPSEARCH
Authors: ,
Keywords: programming: fractional
Abstract:

In this paper an algorithm to solve a Bilevel Programming Problem in which the leader's and the follower's objective functions both are linear fractional is developed. The algorithm is based on Preemptive Goal Programming. The Bilevel Programming problem is solved by converting it into a goal programming problem. An example to illustrate it is also presented.

Reviews

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