Results 21 to 30 of about 188,919 (293)
Approximating the Pareto set of multiobjective linear programs via robust optimization [PDF]
Operations Research Letters, 2012 We consider problems with multiple linear objectives and linear constraints and use Adjustable Robust Optimization and Polynomial Optimization as tools to approximate the Pareto set with polynomials of arbitrarily large degree. The main difference with existing techniques is that we optimize a single (extended) optimization problem that provides a ...
Gorissen, B.L., den Hertog, D.
openaire +5 more sources
A PROPERTY OF BICRITERIA AFFINE VECTOR VARIATIONAL INEQUALITIES
Tạp chí Khoa học Đại học Đà Lạt, 2012 By a scalarization method, it is proved that both the Pareto solution set and the weak Pareto solution set of a bicriteria affine vector variational inequality have finitely many connected. components provided that a regularity condition is satisfied. An
Nguyễn Thị Thu Hương +3 more
doaj +1 more source
Journal of Telecommunications and Information Technology, 2003 Multiple criteria evolutionary algorithms, being essentially parallel in their character, are a natural instrument of finding a representation of entire Pareto set (set of solutions and outcomes non-dominated in criteria space) for vector optimisation ...
Marcin Szczepański +1 more
doaj +1 more source
High-Fidelity Surrogate Based Multi-Objective Optimization Algorithm
Algorithms, 2022 The employment of conventional optimization procedures that must be repeatedly invoked during the optimization process in real-world engineering applications is hindered despite significant gains in computing power by computationally expensive models. As
Adel Younis, Zuomin Dong
doaj +1 more source
Quasi-stability of a vector trajectorial problem with non-linear partial criteria [PDF]
Computer Science Journal of Moldova, 2003 Multi-objective (vector) combinatorial problem of finding the Pareto set with four kinds of non-linear partial criteria is considered. Necessary and sufficient conditions of that kind of stability of the problem (quasi-stability) are obtained.
Vladimir A. Emelichev +1 more
doaj
IEEE Open Journal of Vehicular Technology, 2021 Integrated ground-air-space (IGAS) networks intrinsically amalgamate terrestrial and non-terrestrial communication techniques in support of universal connectivity across the globe.
Jingjing Cui +5 more
doaj +1 more source
Local Optimal Sets and Bounded Archiving on Multi-objective NK-Landscapes with Correlated Objectives [PDF]
, 2014 The properties of local optimal solutions in multi-objective combinatorial optimization problems are crucial for the effectiveness of local search algorithms, particularly when these algorithms are based on Pareto dominance.
E. Zitzler +11 more
core +5 more sources
An algorithm for approximating the Pareto set of the multiobjective set covering problem
Annals of Operations Research, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weerasena, Lakmali +2 more
openaire +3 more sources
On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteria [PDF]
Computer Science Journal of Moldova, 2004 We consider one type of stability (quasistability) of a vector combinatorial problem of finding the Pareto set. Under quasistability we understand a discrete analogue of lower semicontinuity by Hausdorff of the many-valued mapping, which defines the ...
Vladimir A. Emelichev +2 more
doaj
A Novel Model for Optimizing Selection of Cloud Instance Types
IEEE Access, 2019 With the development of cloud computing, the cloud market is becoming more and more complicated. In a cloud data center, there are many cloud instance types with different computing capacity and price, which brings users some confusions when they select ...
Wenqiang Liu +5 more
doaj +1 more source