LFS functions in stable bilevel programming
We study stability, optimality and duality theory in convex bilevel programming using a parametric lexicographic programming approach. The results are significantly simplified if the constraints functions have locally flat surfaces.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
McGill University
1997
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=27913 |