scholarly journals Stability kernel of vector optimization problems under perturbations of criterion functions

Author(s):  
Т.Т. Lebedeva ◽  
◽  
N.V. Semenova ◽  
T.I. Sergienko ◽  
◽  
...  

The article is devoted to the study of the influence of uncertainty in initial data on the solutions of optimiza-tion multicriterial problems. In the optimization problems, including problems with vector criterion, small per-turbations in initial data can result in solutions strongly different from the true ones. The results of the con-ducted researches allow us to extend the known class of vector optimization problems, stable with respect to in-put data perturbations in vector criterion. We are talking about stability in the sense of Hausdorff lower semicontinuity for point-set mapping that characterizes the dependence of the set of optimal solutions on the input data of the vector optimization problem. The conditions of stability against input data perturbations in vector criterion for the problem of finding Pareto optimal solutions with continuous partial criterion func-tions and feasible set of arbitrary structure are obtained by studying the sets of points that are stable belonging and stable not belonging to the Pareto set.

2021 ◽  
Vol 2 (3) ◽  
Author(s):  
Najeeb Abdulaleem

AbstractIn this paper, a class of E-differentiable vector optimization problems with both inequality and equality constraints is considered. The so-called vector mixed E-dual problem is defined for the considered E-differentiable vector optimization problem with both inequality and equality constraints. Then, several mixed E-duality theorems are established under (generalized) V-E-invexity hypotheses.


Author(s):  
Tetiana Lebedeva ◽  
Natalia Semenova ◽  
Tetiana Sergienko

The article is devoted to the study of the influence of uncertainty in initial data on the solutions of mixed integer optimization vector problems. In the optimization problems, including problems with vector criterion, small perturbations in initial data can result in solutions strongly different from the true ones. The problem of stability of the indicated tasks is studied from the point of view of direct coupled with her question in relation to stability of solutions belonging to some subsets of feasible set.


2001 ◽  
Vol 25 (9) ◽  
pp. 621-628
Author(s):  
Fatma M. Ali

A new method for obtaining sensitivity information for parametric vector optimization problems(VOP)vis presented, where the parameters in the objective functions and anywhere in the constraints. This method depends on using differential equations technique for solving multiobjective nonlinear programing problems which is very effective in finding many local Pareto optimal solutions. The behavior of the local solutions for slight perturbation of the parameters in the neighborhood of their chosen initial values is presented by using the technique of trajectory continuation. Finally some examples are given to show the efficiency of the proposed method.


2017 ◽  
Vol 27 (2) ◽  
pp. 153-167 ◽  
Author(s):  
M. Dhingra ◽  
C.S. Lalitha

In this paper we introduce a notion of minimal solutions for set-valued optimization problem in terms of improvement sets, by unifying a solution notion, introduced by Kuroiwa [15] for set-valued problems, and a notion of optimal solutions in terms of improvement sets, introduced by Chicco et al. [4] for vector optimization problems. We provide existence theorems for these solutions, and establish lower convergence of the minimal solution sets in the sense of Painlev?-Kuratowski.


2014 ◽  
Vol 30 (1) ◽  
pp. 101-108
Author(s):  
MIHAELA MIHOLCA ◽  

In this paper, we present the concept of generalized invexity for vector-valued functions. Also, we consider different kinds of generalized vector variational-like inequality and a vector optimization problem. Some relations between vector variational-like inequalities and a vector optimization problem are established by using the properties of Mordukhovich limiting subdifferential.


2013 ◽  
Vol 2013 ◽  
pp. 1-10
Author(s):  
Qinghai He ◽  
Weili Kong

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. Dropping the compactness assumption, we establish some results on structure of the weak Pareto solution set, Pareto solution set, weak Pareto optimal value set, and Pareto optimal value set of (SVOP) and on connectedness of Pareto solution set and Pareto optimal value set of (SVOP). In particular, we improved and generalize, Arrow, Barankin, and Blackwell’s classical results in Euclidean spaces and Zheng and Yang’s results in general Banach spaces.


Sign in / Sign up

Export Citation Format

Share Document