By Topic

Global convergent algorithm for the bilevel linear fractional-linear programming based on modified convex simplex method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wang, Guangmin ; School of Economics and Management, China University of Geosciences, Wuhan 430074, P. R. China ; Jianq, Bing ; Zhu, Kejun ; Wan, Zhongping

A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional single level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modified convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm.

Published in:

Systems Engineering and Electronics, Journal of  (Volume:21 ,  Issue: 2 )