Results 11 to 20 of about 190,364 (297)
On the invariance of the Pareto optimal set [PDF]
Computer Science Journal of Moldova, 1993 In the previous paper presented at the 11th SOR, Darmstadt 1986, the authors had shown that the Pareto optimal set of a multicriteria problem remains invariable if on the objective vector function operates a strictly monotone operator of strictly ...
Vincentiu Dumitru, Florica Luban
doaj +2 more sources
Beliefs and Pareto Efficient Sets: A Remark [PDF]
Journal of Economic Theory, 2002 We show that, in a two-period economy with uncertainty in the second period, if an allocation is Pareto optimal for a given set of beliefs and remains optimal when these beliefs are changed, then the set of optimal allocations of the two economies must ...
Jean-Marc Tallon, Thibault Gajdos
core +5 more sources
, 2023 In bi-criteria optimization problems, the goal is typically to compute the set of Pareto-optimal solutions. Many algorithms for these types of problems rely on efficient merging or combining of partial solutions and filtering of dominated solutions in the resulting sets.
Demian Hespe +3 more
openaire +4 more sources
One-exact approximate Pareto sets [PDF]
Journal of Global Optimization, 2020 AbstractPapadimitriou and Yannakakis (Proceedings of the 41st annual IEEE symposium on the Foundations of Computer Science (FOCS), pp 86–92, 2000) show that the polynomial-time solvability of a certain auxiliary problem determines the class of multiobjective optimization problems that admit a polynomial-time computable $$(1+\varepsilon , \dots , 1 ...
Arne Herzel +4 more
openaire +5 more sources
On the hierarchical structure of Pareto critical sets [PDF]
Journal of Global Optimization, 2019 In this article we show that the boundary of the Pareto critical set of an unconstrained multiobjective optimization problem (MOP) consists of Pareto critical points of subproblems considering subsets of the objective functions. If the Pareto critical set is completely described by its boundary (e.g.
Bennet Gebken +2 more
openaire +3 more sources
An Analysis on Selection for High-Resolution Approximations in Many-Objective Optimization [PDF]
, 2014 This work studies the behavior of three elitist multi- and many-objective evolutionary algorithms generating a high-resolution approximation of the Pareto optimal set.
Aguirre, Hernan +3 more
core +3 more sources
Abstract and Applied Analysis, 2013 In general Banach spaces, we consider a vector optimization problem (SVOP) in which the objective is a set-valued mapping whose graph is the union of finitely many polyhedra or the union of finitely many generalized polyhedra.
Qinghai He, Weili Kong
doaj +1 more source
Bandit Pareto Set Identification: the Fixed Budget Setting
CoRR, 2023 We study a multi-objective pure exploration problem in a multi-armed bandit model. Each arm is associated to an unknown multi-variate distribution and the goal is to identify the distributions whose mean is not uniformly worse than that of another distribution: the Pareto optimal set.
Kone, Cyrille +2 more
openaire +4 more sources
Determining a Robust, Pareto Optimal Geometry for a Welded Joint [PDF]
, 2014 Multi-criteria optimization problems are known to give rise to a set of Pareto optimal solutions where one solution cannot be regarded as being superior to another.
Barrans, Simon, Radhi, H.E.
core +1 more source
On one type of stability for multiobjective integer linear programming problem with parameterized optimality [PDF]
Computer Science Journal of Moldova, 2020 A multiobjective problem of integer linear programming with parametric optimality is addressed. The parameterization is introduced by dividing a set of objectives into a family of disjoint subsets, within each Pareto optimality is used to establish ...
Vladimir A. Emelichev, Yury Nikulin
doaj