scholarly journals Generalized Stampacchia Vector Variational-Like Inequalities and Vector Optimization Problems Involving Set-Valued Maps

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Yanfei Chai ◽  
Sanyang Liu ◽  
Guotao Wang
Keyword(s):  
Vector Optimization ◽  
Optimization Problems ◽  
Efficient Solutions ◽  
Vector Optimization Problem ◽  
Gap Functions ◽  
Weak Formulation ◽  
Existence Of A Solution ◽  
Weakly Efficient Solutions ◽  
Set Valued Mapping ◽  
Finite Dimensional

We first obtain that subdifferentials of set-valued mapping from finite-dimensional spaces to finite-dimensional possess certain relaxed compactness. Then using this weak compactness, we establish gap functions for generalized Stampacchia vector variational-like inequalities which are defined by means of subdifferentials. Finally, an existence result of generalized weakly efficient solutions for vector optimization problem involving a subdifferentiable and preinvex set-valued mapping is established by exploiting the existence of a solution for the weak formulation of the generalized Stampacchia vector variational-like inequality via a Fan-KKM lemma.

scholarly journals Structure of Pareto Solutions of Generalized Polyhedral-Valued Vector Optimization Problems in Banach Spaces

2013 ◽  
Vol 2013 ◽  
pp. 1-10
Author(s):  
Qinghai He ◽  
Weili Kong
Keyword(s):  
Banach Spaces ◽  
Vector Optimization ◽  
Optimization Problems ◽  
Vector Optimization Problem ◽  
Solution Set ◽  
Pareto Optimal ◽  
Pareto Solution ◽  
Value Set ◽  
Set Valued Mapping ◽  
Optimal Value

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.

scholarly journals Approximate Efficient Solutions of the Vector Optimization Problem on Hadamard Manifolds via Vector Variational Inequalities

Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2196
Author(s):  
Gabriel Ruiz-Garzón ◽  
Rafaela Osuna-Gómez ◽  
Antonio Rufián-Lizana ◽  
Beatriz Hernández-Jiménez
Keyword(s):  
Vector Optimization ◽  
Optimization Problem ◽  
Equilibrium Points ◽  
Variational Problems ◽  
Efficient Solutions ◽  
Vector Optimization Problem ◽  
Stackelberg Equilibrium ◽  
Hadamard Manifolds ◽  
Geodesic Convexity ◽  
Weakly Efficient Solutions

This article has two objectives. Firstly, we use the vector variational-like inequalities problems to achieve local approximate (weakly) efficient solutions of the vector optimization problem within the novel field of the Hadamard manifolds. Previously, we introduced the concepts of generalized approximate geodesic convex functions and illustrated them with examples. We see the minimum requirements under which critical points, solutions of Stampacchia, and Minty weak variational-like inequalities and local approximate weakly efficient solutions can be identified, extending previous results from the literature for linear Euclidean spaces. Secondly, we show an economical application, again using solutions of the variational problems to identify Stackelberg equilibrium points on Hadamard manifolds and under geodesic convexity assumptions.

Lagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued maps

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Renying Zeng
Keyword(s):  
Optimality Conditions ◽  
Vector Optimization ◽  
Optimization Problems ◽  
Efficient Solutions ◽  
Vector Optimization Problems ◽  
Lagrangian Multipliers ◽  
Weakly Efficient Solutions ◽  
Affine Maps ◽  
Convex Vector Optimization ◽  
Affine Set

Abstract In this paper, we introduce some definitions of generalized affine set-valued maps: affinelike, preaffinelike, nearaffinelike, and prenearaffinelike maps. We present examples to explain that our definitions of generalized affine maps are different from each other. We derive a theorem of alternative of Farkas–Minkowski type, discuss Lagrangian multipliers for constrained set-valued optimization problems, and obtain some optimality conditions for weakly efficient solutions.

scholarly journals Finding Vector Critical Points on Hadamard Manifolds: Nonsmooth Case

2020 ◽  
Author(s):  
Gabriel Ruiz-Garzón ◽  
Rafaela Osuna-Gómez ◽  
Antonio Rufián-Lizana
Keyword(s):  
Vector Optimization ◽  
Critical Points ◽  
Optimization Problems ◽  
Equilibrium Points ◽  
Efficient Solutions ◽  
Hadamard Manifolds ◽  
Weakly Efficient Solutions ◽  
Economic Application ◽  
Payoff Functions ◽  
First Time

The aims of this paper are twofold. First, it is shown, for the first time, which types of nonsmooth functions are characterized by all vector critical points as being efficient or weakly efficient solutions of vector optimization problems in constrained and unconstrained scenarios on Hadamard manifolds. This implies the need to extend different concepts, such as the Karush--Kuhn--Tucker vector critical points and generalized invexity functions, to Hadamard manifolds. The relationships between these quantities are clarified through a great number of explanatory examples. Second, we present an economic application proving that Nash's critical and equilibrium points coincide in the case of invex payoff functions.

scholarly journals On the Generic Uniqueness of Pareto-Efficient Solutions of Vector Optimization Problems

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Dejin Zhang ◽  
Shuwen Xiang ◽  
Yanlong Yang ◽  
Xicai Deng
Keyword(s):  
Vector Optimization ◽  
Efficient Solution ◽  
Optimization Problems ◽  
Baire Category ◽  
Efficient Solutions ◽  
Vector Optimization Problems ◽  
Weakly Efficient Solution ◽  
Weakly Efficient Solutions ◽  
Pareto Efficient ◽  
Generic Uniqueness

In this paper, the generic uniqueness of Pareto weakly efficient solutions, especially Pareto-efficient solutions, of vector optimization problems is studied by using the nonlinear and linear scalarization methods, and some further results on the generic uniqueness are proved. These results present that, for most of the vector optimization problems in the sense of the Baire category, the Pareto weakly efficient solution, especially the Pareto-efficient solution, is unique. Furthermore, based on these results, the generic Tykhonov well-posedness of vector optimization problems is given.

scholarly journals Mixed E-duality for E-differentiable Vector Optimization Problems Under (Generalized) V-E-invexity

2021 ◽  
Vol 2 (3) ◽  
Author(s):  
Najeeb Abdulaleem
Keyword(s):  
Vector Optimization ◽  
Optimization Problem ◽  
Dual Problem ◽  
Optimization Problems ◽  
Vector Optimization Problem ◽  
Equality Constraints ◽  
Vector Optimization Problems ◽  
Duality Theorems ◽  
Differentiable Vector

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.

Sign in / Sign up

Export Citation Format

Share Document