Abstract
In this paper, we investigate the relationship between a certain class of linear bilevel multifollower programming problems and multiple objective programming. We introduce two multiple objective linear programming problems with different objective functions and the same constraint region. We show that the extreme points of the set of efficient solutions for both problems are the same as those of the set of feasible solutions to the linear bilevel multi-follower programming problem. Based on this relationship, a new algorithm to find an optimal solution for the linear bilevel multifollower programming problem is developed. Some numerical examples are presented to show the feasibility of the proposed algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
