Results 221 to 230 of about 20,451 (264)

Localization sets for pareto eigenvalues with applications

Applied Mathematics Letters, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun He, Yanmin Liu, Xiaowei Shen
openaire   +2 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

Distributed Computation of Pareto Sets

SIAM Journal on Optimization, 2015
The needs of multidisciplinary engineering design have motivated the development of distributed solution approaches to computing efficient solutions to decomposable multiobjective optimization problems (MOPs). The decomposition is necessary due to the assumption that the overall MOP is not solvable since access to its solution space is subproblem ...
Brian C. Dandurand, Margaret M. Wiecek
openaire   +1 more source

Neighbourhood Search for constructing Pareto sets

Mathematical Methods of Operations Research, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gianluca Dorini, Francesco di Pierro, Dragan A. Savic, Alexey B. Piunovskiy   +3 more
openaire   +2 more sources

Thresholds in pareto sets

Journal of Mathematical Economics, 1976
Abstract We use catastrophe theory to discuss the generic ways in which a system determined by the optimization of several real-valued functions, such as a pure exchange economy, can break its stability and make a transition from ‘slow’ to ‘fast’ movement.
openaire   +1 more source

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

On Pareto Dominance in Decomposably Antichain-Convex Sets

Journal of Optimization Theory and Applications, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ceparano, Maria Carmela, Quartieri, Federico   +1 more
openaire   +4 more sources

Pattern identification in pareto-set approximations

Proceedings of the 10th annual conference on Genetic and evolutionary computation, 2008
In a multiobjective setting, evolutionary algorithms can be used to generate a set of compromise solutions. This makes decision making easier for the user as he has alternative solutions at hand which he can directly compare. However, if the number of solutions and the number of decision variables which define the solutions are large, such an analysis ...
Tamara Ulrich, Dimo Brockhoff, Eckart Zitzler   +2 more
openaire   +1 more source

A Comparison of Pareto Sets and Jacobi Sets

2014
Topological analysis of multifields is an approaches to find meaningful, intrinsic structures in complex data. Methods introduced in previous years were usually evaluated separately or rather informally. However, to aid the decision which method is best suited for a particular kind of data, it is important to compare and put them into context with each
Lars Huettenberger, Christoph Garth
openaire   +1 more source