Dominators for multiple-objective quasiconvex maximization problems
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.
- scientific article; zbMATH DE number 824551
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
- scientific article; zbMATH DE number 3936958
- Quasiconcavity and nondominated solutions in multiobjective programming
- Optimizing a linear function over an efficient set
- Efficiency for continuous facility location problems with attraction and repulsion
- Continuous location of dimensional structures.
- Quasiconcavity and nondominated solutions in multiobjective programming
- Weak efficiency in multiobjective quasiconvex optimization on the real-line without derivatives
- Gauge distances and median hyperplanes
This page was built for publication: Dominators for multiple-objective quasiconvex maximization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5927653)
