摘要
In this paper, we study sensitivity analysis of bilevel linear programming. Twocases of the leader’s objective function and the right-hand side of the constraints includingparameters are discussed separately. We presellt a necessary and sufficient optimalitycondition for an optimal solution to a bilevel linear programming problem and its equivalentexpression in nonconvex quadratic programming. The necessary and sufficient conditionsare proposed to guarantee that the current optimal solution or the corresponding basisremains optimal when the parameters vary. An algorithm is also proposed to determinethe set of the parameters which leaves the current optimal solution optimal or -optimal.
In this paper, we study sensitivity analysis of bilevel linear programming. Twocases of the leader's objective function and the right-hand side of the constraints includingparameters are discussed separately. We presellt a necessary and sufficient optimalitycondition for an optimal solution to a bilevel linear programming problem and its equivalentexpression in nonconvex quadratic programming. The necessary and sufficient conditionsare proposed to guarantee that the current optimal solution or the corresponding basisremains optimal when the parameters vary. An algorithm is also proposed to determinethe set of the parameters which leaves the current optimal solution optimal or -optimal.
