610. Bilevel programming via set-valued optimization
Invited abstract in session WB-7: Theory and methods for bilevel optimization, stream Bilevel and multilevel optimization.
Wednesday, 10:30-12:30Room: B100/5015
Authors (first author is the speaker)
| 1. | Kuntal Som
|
| Mathematics, IIT Jodhpur |
Abstract
Bilevel programming is one of the very active areas of research with many real-life applications in economics and engineering. Bilevel problems are hierarchical problems consisting of lower-level and upper-level problems, respectively. The leader or the decision-maker for the upper-level problem decides first, and then the follower or the lower-level decision-maker chooses his/her strategy. In the case of multiple lower-level solutions, the bilevel problems are not well defined, and there are many ways to handle such a situation. One standard way is to put restrictions on the lower level problems (like strict convexity) so that nonuniqueness does not arise. However, those restrictions are not viable in many situations. Therefore, there are two standard formulations, called pessimistic formulations and optimistic formulations of the upper-level problem (see Dempe (Foundations of Bilevel Programming. Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht, 2002)). A set-valued formulation has been proposed in the the literature. However, the study is limited to the continuous set-up with the assumption of value attainment, and the general case has not been considered. In this talk, we focus on the general case and study the connection among various notions of solution. Our main findings suggest that the set-valued formulation may not hold any bigger advantage than the existing optimistic and pessimistic formulation.
Keywords
- Complementarity and variational problems
- Multi-level optimization
- Non-smooth optimization
Status: accepted
Back to the list of papers