Finding the Optimal Solution of Linear Bilevel Program by the Equilibrium Point
Rao Qu-qin · Jiangxi kexue · 2007
In this paper,linear bilevel programming problem(LBP) is considered.The first,(LBP) is changed into no constrained problem by K-T conditions and the penalized method,then,change the no constrained problem into the parametric linear program,and find the solutions of the parametric linear program by the simplex method,the solutions is just the equilibrium point,last,determine which equilibrium point is the optimal solution of LBP.