Artículo
Dominators for multiple-objective quasiconvex maximization problems
Autor/es | Carrizosa Priego, Emilio José
Plastria, Frank |
Departamento | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa |
Fecha de publicación | 2000-01-06 |
Fecha de depósito | 2021-04-23 |
Publicado en |
|
Resumen | In this paper we address the problem of finding a dominator for a multiple-objective
maximization problem with quasiconvex functions. The one-dimensional case is discussed in some
detail, showing how a Branch-and-Bound ... In this paper we address the problem of finding a dominator for a multiple-objective maximization problem with quasiconvex functions. The one-dimensional case is discussed in some detail, showing how a Branch-and-Bound procedure leads to a dominator with certain minimality properties. Then, the well-known result stating that the set of vertices of a polytope S contains an optimal solution for single-objective quasiconvex maximization problems is extended to multipleobjective problems, showing that, under upper-semicontinuity assumptions, the set of (k21)- dimensional faces is a dominator for k-objective problems. In particular, for biobjective quasiconvex problems on a polytope S, the edges of S constitute a dominator, from which a dominator with minimality properties can be extracted by Branch-and Bound methods. |
Cita | Carrizosa Priego, E.J. y Plastria, F. (2000). Dominators for multiple-objective quasiconvex maximization problems. Journal of Global Optimization, 18 (1), 35-58. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Dominators for multiple-objective ... | 137.7Kb | [PDF] | Ver/ | |