On linear bilevel problems with multiple objectives at the lower level
Bilevel programming problems provide a framework to deal with decision processes involving two decision makers with a hierarchical structure. They are characterized by the existence of two optimization problems in which the constraint region of the upper level problem is implicitly determined by the lower level optimization problem. This paper focuses on bilevel problems for which the lower level problem is a linear multiobjective program and constraints at both levels define polyhedra. This bilevel problem is reformulated as an optimization problem over a nonconvex region given by a union of faces of the polyhedron defined by all constraints. This reformulation is obtained when dealing with efficient solutions as well as weakly efficient solutions for the lower level problem. Assuming that the upper level objective function is quasiconcave, then an extreme point exists which solves the problem. An exact and a metaheuristic algorithm are developed and their performance is analyzed and compared.
Year of publication: |
2011
|
---|---|
Authors: | Calvete, Herminia I. ; Galé, Carmen |
Published in: |
Omega. - Elsevier, ISSN 0305-0483. - Vol. 39.2011, 1, p. 33-40
|
Publisher: |
Elsevier |
Keywords: | Bilevel optimization Multiobjective optimization Efficient solution Weakly efficient solution Genetic algorithm |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Calvete, Herminia I., (2021)
-
Calvete, Herminia I., (2021)
-
A new approach for solving linear bilevel problems using genetic algorithms
Calvete, Herminia I., (2008)
- More ...