.png){kind=icon}
.png){kind=icon}
Return
On linear bilevel problems with multiple objectives at the lower level
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2010.02.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
Bilevel optimization
Multiobjective optimization
Efficient solution
Weakly efficient solution
Genetic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
O
IF:
7.2
Papers:
3.7K
Citations:
1.4W