-

 

 

 




Optimization Online





 

Near-optimal Robust Bilevel Optimization

Mathieu Besanšon (mathieu.besancon***at***polymtl.ca)
Miguel F Anjos (anjos***at***stanfordalumni.org)
Luce Brotcorne (luce.brotcorne***at***inria.fr)

Abstract: Bilevel optimization studies problems where the optimal response to a second mathematical optimization problem is integrated in the constraints. Such structure arises in a variety of decision-making problems in areas such as market equilibria, policy design or product pricing. We introduce near-optimal robustness for bilevel problems, protecting the upper-level decision-maker from bounded rationality at the lower level and show it is a restriction of the corresponding pessimistic bilevel problem. Essential properties are derived in generic and specific settings. This model finds a corresponding and intuitive interpretation in various situations cast as bilevel optimization problems. We develop a duality-based solution method for cases where the lower level is convex, leveraging the methodology from robust and bilevel literature. The models obtained are tested numerically using different solvers and formulations, showing the successful implementation of the near-optimal bilevel problem.

Keywords: bilevel optimization, robust optimization, game theory, KKT, bounded rationality, duality, bilinear

Category 1: Robust Optimization

Category 2: Complementarity and Variational Inequalities

Category 3: Integer Programming ((Mixed) Integer Nonlinear Programming )

Citation:

Download: [PDF]

Entry Submitted: 07/27/2019
Entry Accepted: 07/27/2019
Entry Last Modified: 01/14/2020

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society