Results 261 to 270 of about 31,937 (298)

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

Software for Pareto set reduction

2017 Constructive Nonsmooth Analysis and Related Topics (dedicated to the memory of V.F. Demyanov) (CNSA), 2017
An axiomtic approach to the problem of Pareto set reduction is considered. A decision maker is asked questions in order to elicit information on his/her fuzzy binary preference relation. A program is described that uses the obtained fuzzy information to reduce the Pareto set and thereby to facilitate a final choice.
Oleg Baskov, Vladimir Noghin
openaire   +1 more source

Pareto optimality and a class of set covering heuristics

Annals of Operations Research, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicholas G. Hall, Rakesh V. Vohra
openaire   +1 more source

Dynamic programming with Pareto sets

Journal of Applied and Industrial Mathematics, 2010
Under study is the problem of optimal allocation of a resource, and a dynamic programming scheme is proposed for its solution. Instead of the recurrent equations, the stepwise computation of the Pareto-optimal points is used on the plane of values of the target function and resource. Some examples demonstrate the efficiency of this approach.
openaire   +1 more source

Regularization of a set of Pareto points

USSR Computational Mathematics and Mathematical Physics, 1978
Abstract THE PROBLEM of finding a set Pareto points is regularized. A genelization of the Arrow—Barankin—Blackwell theorem is proved. The connection between the set of Pareto points and competitive games is established.
openaire   +2 more sources

A note of fuzzy programming and the pareto optimal set

Fuzzy Sets and Systems, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Strengthened Pareto Equilibrium for Games on Intersecting Sets*

Cybernetics and Systems Analysis, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources