2021-04-232021-04-232000-01-06Carrizosa Priego, E.J. y Plastria, F. (2000). Dominators for multiple-objective quasiconvex maximization problems. Journal of Global Optimization, 18 (1), 35-58.1573-29160925-5001https://hdl.handle.net/11441/107635In 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.application/pdf23 p.engAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Multiple-objective problemsQuasiconvex maximizationDominatorsinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccess10.1023/A:1008312004757