Dominators for multiple-objective quasiconvex maximization problems (Q5927653): Difference between revisions

The paper discusses techniques for the generation of dominators containing the set of efficient (Pareto-optimal) solutions of multiple-objective maximization problems with quasiconvex objective functions. Depending on the structure of the feasible set \(S\), minimality properties of dominators are discussed and branch-and-bound procedures are developed for their determination. The one-dimensional case where the feasible set \(S\) is given as a finite union of compact real intervals, and the polyhedral case where \(S\) is an \(n\)-dimensional polytope are given special attention. An application to a semi-obnoxious facility location problem is presented.