Deriving the Properties of Linear Bilevel Programming via a Penalty Function Approach |
| |
Authors: | Z K Xu |
| |
Institution: | (1) Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang, People's Republic of China |
| |
Abstract: | For the linear bilevel programming problem, we propose an assumption weaker than existing assumptions, while achieving similar results via a penalty function approach. The results include: equivalence between (i) existence of a solution to the problem, (ii) existence of an exact penalty function approach for solving the problem, and (iii) achievement of the optimal value of the equivalent form of the problem at some vertex of a certain polyhedral convex set. We prove that the assumption is both necessary and sufficient for the linear bilevel programming problem to admit an exact penalty function formulation, provided that the equivalent form of the problem has a feasible solution. A method is given for computing the minimal penalty function parameter value. This method can be executed by solving a set of linear programming problems. Lagrangian duality is also presented. |
| |
Keywords: | Linear bilevel programming existence of a solution penalty function approach minimal penalty function parameter value extreme points Lagrangian duality |
本文献已被 SpringerLink 等数据库收录! |
|