The steepest descent direction for the nonlinear bilevel programming problem
- 1 June 1994
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 15 (5), 265-272
- https://doi.org/10.1016/0167-6377(94)90086-8
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A Branch and Bound Algorithm for the Bilevel Programming ProblemSIAM Journal on Scientific and Statistical Computing, 1990
- Directional Behaviour of Optimal Solutions in Nonlinear Mathematical ProgrammingMathematics of Operations Research, 1988
- Convex two-level optimizationMathematical Programming, 1988
- A solution method for the static constrained Stackelberg problem via penalty methodIEEE Transactions on Automatic Control, 1984
- Two-Level Linear ProgrammingManagement Science, 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
- A Representation and Economic Interpretation of a Two-Level Programming ProblemJournal of the Operational Research Society, 1981