Efficient solutions of linear bilevel programming problem
Chen Ke-dong · Journal of systems engineering · 2001
For a linear bilevel programming problem, we prove that an optimal and efficient solution can arrive at some extreme points of constraint region under the assumptions that the constraint region is bounded and some optimal solutions are efficient solutions to the corresponding biobjective programming. Two more reasonable methods for finding efficient solutions are given and several numerical examples are provided.