The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
- 1 January 1995
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 32 (3) , 193-209
- https://doi.org/10.1080/02331939508844048
Abstract
In this paper, we study regularity and optimality conditions for the BLPP by using a marginal function formulation, where the marginal function is defined by the optimal value function of the lower problem. We address the regularity issue by exploring the structure of the tangent cones of the feasible set of the BLPP. These regularity results indicate that the nonlinear/nonlinear BLPP is most likely degenerate and a class of nonlinear/linear BLPP is regular in the conventional sense. Existence of exact penalty function is proved for a class of nonlinear/linear BLPP. Fritz-John type optimality conditions are derived for nonlinear BLPP, while KKT type conditions are obtained for a class of nonlinear/linear BLPP in the framework of nonsmooth analysis. A typical example is examined for these conditions and some applications of these conditions are pointed outKeywords
This publication has 17 references indexed in Scilit:
- A solution method for the linear static Stackelberg problem using penalty functionsIEEE Transactions on Automatic Control, 1990
- On the structure and properties of a linear multilevel programming problemJournal of Optimization Theory and Applications, 1989
- Two-Level Linear ProgrammingManagement Science, 1984
- Optimality conditions for the bilevel programming problemNaval Research Logistics Quarterly, 1984
- An Algorithm for Solving the General Bilevel Programming ProblemMathematics of Operations Research, 1983
- On two-level optimizationIEEE Transactions on Automatic Control, 1982
- An explicit solution to the multi-level programming problemComputers & Operations Research, 1982
- A linear two-level programming problemComputers & Operations Research, 1982
- Hierarchical Decentralized Systems and Its New Solution by a Barrier MethodIEEE Transactions on Systems, Man, and Cybernetics, 1981
- Constraint qualifications in maximization problemsNaval Research Logistics Quarterly, 1961