On the Quasiconcave Bilevel Programming Problem |
| |
Authors: | Calvete H. I. Galé C. |
| |
Affiliation: | (1) Departamento de Métodos Estadísticos, Universidad de Zaragoza, Zaragoza, Spain;(2) Departamento de Métodos Estadísticos, Universidad de Zaragoza, Zaragoza, Spain |
| |
Abstract: | Bilevel programming involves two optimization problems where the constraint region of the first-level problem is implicitly determined by another optimization problem. In this paper, we consider the case in which both objective functions are quasiconcave and the constraint region common to both levels is a polyhedron. First, it is proved that this problem is equivalent to minimizing a quasiconcave function over a feasible region comprised of connected faces of the polyhedron. Consequently, there is an extreme point of the polyhedron that solves the problem. Finally, it is shown that this model includes the most important case where the objective functions are ratios of concave and convex functions |
| |
Keywords: | Bilevel programming quasiconcave functions optimal solutions fractional programming |
本文献已被 SpringerLink 等数据库收录! |
|