Abstract
We consider the approximation of nonlinear bilevel mathematical
programs by solvable programs of the same type, {\it i.e.}, bilevel
programs involving linear approximations of the upper-level
objective and all constraint-defining functions, as well as
a quadratic approximation of the lower-level objective.
We describe the main features of the algorithm and the resulting software. Numerical experiments tend to confirm the promising behavior of the method.
Original language | English |
---|---|
Pages (from-to) | 211-227 |
Number of pages | 17 |
Journal | Computational Optimization and Applications |
Volume | 30 |
Issue number | 3 |
Publication status | Unpublished - 2004 |
Keywords
- numerical results
- Bilevel programming
- approximation
- trust-region methods
- nonlinear programming