A necessary and a sufficient optimality condition for bilevel programming problems
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 25 (4), 341-354
- https://doi.org/10.1080/02331939208843831
Abstract
A necessary and a sufficient condition for local optimal solutions of bilevel programming problems are developed using differential stability results for parametric optimization problems. Verification of these conditions reduces to the solution of some auxiliary combinatorial optimization problems.Keywords
This publication has 23 references indexed in Scilit:
- On the directional derivative of the optimal solution mapping without linear independence constraint qualificationOptimization, 1989
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivityPublished by Springer Nature ,1987
- Existence theorems of equilibrium points in stackelbergOptimization, 1987
- A simple algorithm for the-linear bilevel programming problemOptimization, 1987
- A solution method for the static constrained Stackelberg problem via penalty methodIEEE Transactions on Automatic Control, 1984
- Solution point differentiability without strict complementarity in nonlinear programmingPublished by Springer Nature ,1984
- Directional derivative of the marginal function in nonlinear programmingPublished by Springer Nature ,1984
- An explicit solution to the multi-level programming problemComputers & Operations Research, 1982
- A linear two-level programming problemComputers & Operations Research, 1982
- A Representation and Economic Interpretation of a Two-Level Programming ProblemJournal of the Operational Research Society, 1981