-

 

 

 




Optimization Online





 

Bilevel optimization with a multiobjective problem in the lower level

Roberto Andreani(andreani***at***ime.unicamp.br)
Viviana A. Ramirez(viviramirezana***at***gmail.com)
Sandra A. Santos(sandra***at***ime.unicamp.br)
Leonardo D. Secchin(leonardo.secchin***at***ufes.br)

Abstract: Bilevel problems model instances with a hierarchical structure. Aiming at an efficient solution of a constrained multiobjective problem according with some pre-defined criterion, we reformulate this optimization but non standard problem as a classic bilevel one. This reformulation intents to encompass all the objectives, so that the properly efficient solution set is recovered by means of a convenient weighted-sum scalarization approach. Inexact restoration strategies potentially take advantage of the structure of the problem under consideration, being employed as an alternative to the Karush-Kuhn-Tucker reformulation of the bilevel problem. Genuine multiobjective problems possess inequality constraints in their modelling, and these constraints generate theoretical and practical difficulties to our lower level problem. We handle these difficulties by means of a perturbation strategy, providing the convergence analysis, together with enlightening examples and illustrative numerical tests.

Keywords: Bilevel optimization; inexact restoration; multiobjective optimization; KKT reformulation; numerical experiments

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Category 2: Other Topics (Multi-Criteria Optimization )

Citation:

Download: [PDF]

Entry Submitted: 04/14/2017
Entry Accepted: 04/14/2017
Entry Last Modified: 04/14/2017

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