Scalarization and sensitivity analysis in Vector Optimization. The linear case
نویسندگان
چکیده
In this paper we consider a vector optimization problem; we present some scalarization techniques for finding all the vector optimal points of this problem and we discuss the relationships between these methods. Moreover, in the linear case, the study of dual variables is carried on by means of sensitivity analysis and also by a parametric approach. We also give an interpretation of the dual variables as marginal rates of substitution of an objective function with respect to another one, and of an objective function with respect to a constraint.
منابع مشابه
Hölder continuity of solution maps to a parametric weak vector equilibrium problem
In this paper, by using a new concept of strong convexity, we obtain sufficient conditions for Holder continuity of the solution mapping for a parametric weak vector equilibrium problem in the case where the solution mapping is a general set-valued one. Without strong monotonicity assumptions, the Holder continuity for solution maps to parametric weak vector optimization problems is discussed.
متن کاملSENSITIVITY ANALYSIS IN LINEAR-PLUS-LINEAR FRACTIONAL PROGRAMMING PROBLEMS
In this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary.
متن کاملSequential Characterization of Solutions in Convex Composite Programming and Applications to Vector Optimization
When characterizing optimal solutions of both scalar and vector optimization problems usually constraint qualifications have to be satisfied. By considering sequential characterizations, given for the first time in vector optimization in this paper, this drawback is eliminated. In order to establish them we give first of all sequential characterizations for a convex composed optimization proble...
متن کاملDuality for vector optimization problems via a general scalarization
Considering a vector optimization problem to which properly efficient solutions are defined by using convex cone-monotone scalarization functions, we attach to it, by means of perturbation theory, new vector duals. When the primal problem, the scalarization function and the perturbation function are particularized, different dual vector problems are obtained, some of them already known in the l...
متن کاملOn Scalarization of Vector Optimization Type Problems
We consider scalarization issues for vector problems in the case where the preference relation is represented by a rather arbitrary set. An algorithm for weights choice for a priori unknown preference relations is suggested. Some examples of applications to vector optimization, game equilibrium, and variational inequalities are described. DOI: 10.3103/S1066369X12090022
متن کامل