Results 241 to 250 of about 188,919 (293)

Biobjective robust optimization over the efficient set for Pareto set reduction

European Journal of Operational Research, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jornada, Daniel, Leon, V. Jorge
openaire   +4 more sources

The smart normal constraint method for directly generating a smart Pareto set

Structural and Multidisciplinary Optimization, 2013
In design situations where a single solution must be selected, it is often desirable to present the designer with a smart Pareto set of solutions--a minimal set of nondominated solutions that sufficiently represents the tradeoff characteristics of the design space.
Braden J. Hancock, Christopher A. Mattson   +1 more
openaire   +3 more sources

The liberal paradox and the pareto set

Mathematical Social Sciences, 1985
This paper examines the liberal paradox. When the set of alternatives, X, is a disjoint union of sets \(X_ i\), one for each voter, the liberal paradox occurs if and only if the Pareto set contains no element u of any \(X_ i\) such that voter i prefers u to any other element of \(X_ i.\) When the set of all preference profiles is given the equiprobable
Kim, Ki Hang, Roush, Fred W.
openaire   +2 more sources

Maintaining Diversity in The Bounded Pareto-Set

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion, 2016
For more than two decades, stand-alone evolutionary multi-objective optimization (EMO) methods have been adequately demonstrated to find a set of trade-off solutions near Pareto-front for various multi-objective optimization problems. Despite a long-standing existence of classical generative single-objective based methods, a very few EMO studies have ...
AKM Khaled Ahsan Talukder, Kalyanmoy Deb, Shahryar Rahnamayan   +2 more
openaire   +1 more source

The Pareto set of the partition bargaining problem

Games and Economic Behavior, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Granot, Daniel, Rothblum, Uriel G.
openaire   +1 more source

Multicriterial decision making model with the empty pareto set

Annual Review in Automatic Programming, 1985
A tournamental model for multicriterial decision making is presented.
Zhukovin, V. E., Burshtein, F. V., Zhukovin, E. V.   +2 more
openaire   +2 more sources

On the approximation of a pareto set

USSR Computational Mathematics and Mathematical Physics, 1984
The problem is to determine the Pareto set related to \(''\max ''_{x\in X}f\), \(f=(f_ 1,...,f_ m)\), \(X\subseteq {\mathbb{R}}^ n\) compact feasible solution set, \(Y=f(X)=\{y\in {\mathbb{R}}^ m|\) \(y=f(x)\), \(x\in X\}\). Let \(V\subseteq {\mathbb{R}}^ m\) be any set.
openaire   +3 more sources

Reducing the Pareto set based on set-point information

Scientific and Technical Information Processing, 2011
An axiomatic approach to reducing the Pareto set in the problem of multicriteria choice based on an information set obtained from the decision maker is considered. The information reflects the degree up to which the decision maker is ready to lose values of one group of criteria to improve values of several other groups of criteria.
openaire   +1 more source