Optimality Conditions for Vector Equilibrium Problems in Terms of Contingent Epiderivatives

In this article, we study some important properties of contingent epiderivatives concerning steady functions and a cone with a compact base along with its applications to establish necessary and sufficient optimality conditions for weakly efficient, Henig efficient, globally efficient and superefficient solutions for no constraints and constraints (it concludes cone constraint, equality constraint and a constraint set) vector equilibrium problems in terms of contingent epiderivatives. We also give some examples to illustrate obtained results.     

Optimality conditions for various efficient solutions involving coderivatives: From set-valued optimization problems to set-valued equilibrium problems

We present a new approach to the study of a set-valued equilibrium problem (for short, SEP) through the study of a set-valued optimization problem with a geometric constraint (for short, SOP) based on an equivalence between solutions of these problems. As illustrations, we adapt to SEP enhanced notions of relative Pareto efficient solutions introduced in set optimization by Bao and Mordukhovich and derive from known or new optimality conditions for various efficient solutions of SOP similar results for solutions of SEP as well as for solutions of a vector equilibrium problem and a vector variational inequality.We also introduce the concept of quasi weakly efficient solutions for the above problems and divide all efficient solutions under consideration into the Pareto-type group containing Pareto efficient, primary relative efficient, intrinsic relative efficient, quasi relative efficient solutions and the weak Pareto-type group containing quasi weakly efficient, weakly efficient, strongly efficient, positive properly efficient, Henig global properly efficient, Henig properly efficient, super efficient and Benson properly efficient solutions. The necessary conditions for Pareto-type efficient solutions and necessary/sufficient conditions for weak Pareto-type efficient solutions formulated here are expressed in terms of the Ioffe approximate coderivative and normal cone in the Banach space setting and in terms of the Mordukhovich coderivative and normal cone in the Asplund space setting.     

Scalarization and optimality conditions for vector equilibrium problems

In this paper, we investigated vector equilibrium problems and gave the scalarization results for weakly efficient solutions, Henig efficient solutions, and globally efficient solutions to the vector equilibrium problems without the convexity assumption. Using nonsmooth analysis and the scalarization results, we provided the necessary conditions for weakly efficient solutions, Henig efficient solutions, globally efficient solutions, and superefficient solutions to vector equilibrium problems. By the assumption of convexity, we gave sufficient conditions for those solutions. As applications, we gave the necessary and sufficient conditions for corresponding solutions to vector variational inequalities and vector optimization problems.     

向量映射的鞍点和Lagrange对偶问题

本文研究拓扑向量空间广义锥-次类凸映射向量优化问题的鞍点最优性条件和Lagrange对偶问题,建立向量优化问题的Fritz John鞍点和Kuhn-Tucker鞍点的最优性条件及其与向量优化问题的有效解和弱有效解之间的联系。通过对偶问题和向量优化问题的标量化刻画各解之间的关系,给出目标映射是广义锥-次类凸的向量优化问题在其约束映射满足广义Slater约束规格的条件下的对偶定理。     

Existence and stability of solutions for a class of generalized vector equilibrium problems

In this paper, two existence theorems concerning the strong efficient solutions and the weakly efficient solutions of generalized vector equilibrium problems are derived by using the Fan-KKM Theorem and an existence theorem for the efficient solutions of generalized vector equilibrium problems is established by using the scalarization method. Moreover, the lower semicontinuity of the strong efficient solution mapping and the weakly efficient solution mapping to parametric generalized vector equilibrium problems are showed under suitable conditions with neither monotonicity nor any information of the solution mappings. Finally, some applications to the vector optimization problems and the Stackelberg equilibrium problem are also given.     

Strictly feasible solutions and strict complementarity in multiple objective linear optimization

Recently, Luc defined a dual program for a multiple objective linear program. The dual problem is also a multiple objective linear problem and the weak duality and strong duality theorems for these primal and dual problems have been established. Here, we use these results to prove some relationships between multiple objective linear primal and dual problems. We extend the available results on single objective linear primal and dual problems to multiple objective linear primal and dual problems. Complementary slackness conditions for efficient solutions, and conditions for the existence of weakly efficient solution sets and existence of strictly primal and dual feasible points are established. We show that primal-dual (weakly) efficient solutions satisfying strictly complementary conditions exist. Furthermore, we consider Isermann’s and Kolumban’s dual problems and establish conditions for the existence of strictly primal and dual feasible points. We show the existence of primal-dual feasible points satisfying strictly complementary conditions for Isermann’s dual problem. Also, we give an alternative proof to establish necessary conditions for weakly efficient solutions of multiple objective programs, assuming the Kuhn–Tucker (KT) constraint qualification. We also provide a new condition to ensure the KT constraint qualification.     

非强制混合向量变分不等式解的存在性研究

本文利用例外簇方法研究非强制混合向量变分不等式的弱有效解的存在性:首先证明若混合向量变分不等式问题不存在例外簇,则混合向量变分不等式问题的弱有效解集为非空集合:利用向量值映射的渐近映射给出自反Banach空间中非强制混合向量变分不等式的弱有效解集不存在例外簇的充分条件,从而得到混合向量变分不等式问题的弱有效解的存在性结...     

Optimality conditions for nonsmooth semi-infinite multiobjective programming

This paper is devoted to the study of nonsmooth multiobjective semi-infinite programming problems in which the index set of the inequality constraints is an arbitrary set not necessarily finite. We introduce several kinds of constraint qualifications for these problems, and then necessary optimality conditions for weakly efficient solutions are investigated. Finally by imposing assumptions of generalized convexity we give sufficient conditions for efficient solutions.     

Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems

In this paper, we first establish characterizations of the nonemptiness and compactness of the set of weakly efficient solutions of a convex vector optimization problem with a general ordering cone (with or without a cone constraint) defined in a finite dimensional space. Using one of the characterizations, we further establish for a convex vector optimization problem with a general ordering cone and a cone constraint defined in a finite dimensional space the equivalence between the nonemptiness and compactness of its weakly efficient solution set and the generalized type I Levitin-Polyak well-posednesses. Finally, for a cone-constrained convex vector optimization problem defined in a Banach space, we derive sufficient conditions for guaranteeing the generalized type I Levitin-Polyak well-posedness of the problem.     

Optimality conditions for directionally differentiable multi-objective programming problems

This paper is concerned with the optimality for multi-objective programming problems with nonsmooth and nonconvex (but directionally differentiable) objective and constraint functions. The main results are Kuhn-Tucker type necessary conditions for properly efficient solutions and weakly efficient solutions. Our proper efficiency is a natural extension of the Kuhn-Tucker one to the nonsmooth case. Some sufficient conditions for an efficient solution to be proper are also given. As an application, we derive optimality conditions for multi-objective programming problems including extremal-value functions.This work was done while the author was visiting George Washington University, Washington, DC.     

Weak efficiency in multiobjective variational problems under generalized convexity

In this paper, we provide new pseudoinvexity conditions on the involved functionals of a multiobjective variational problem, such that all vector Kuhn-Tucker or Fritz John points are weakly efficient solutions if and only if these conditions are fulfilled. We relate weakly efficient solutions to optimal solutions of weighting problems. We improve recent papers, and we generalize pseudoinvexity conditions used in multiobjective mathematical programming, so as some of their characterization results. The new conditions and results are illustrated with an example.     

Optimality of E-pseudoconvex multi-objective programming problems without constraint qualifications

In this note, we consider the optimality criteria of multi-objective programming problems without constraint qualifications involving generalized convexity. Under the E-pseudoconvexity assumptions, the unified necessary and sufficient optimality conditions are established for weakly efficient and efficient solutions, respectively, in multi-objective programming problems.     

Second-order conditions for nonsmooth multiobjective optimization problems with inclusion constraints

This paper investigates second-order optimality conditions for general multiobjective optimization problems with constraint set-valued mappings and an arbitrary constraint set in Banach spaces. Without differentiability nor convexity on the data and with a metric regularity assumption the second-order necessary conditions for weakly efficient solutions are given in the primal form. Under some additional assumptions and with the help of Robinson -Ursescu open mapping theorem we obtain dual second-order necessary optimality conditions in terms of Lagrange-Kuhn-Tucker multipliers. Also, the second-order sufficient conditions are established whenever the decision space is finite dimensional. To this aim, we use the second-order projective derivatives associated to the second-order projective tangent sets to the graphs introduced by Penot. From the results obtained in this paper, we deduce and extend, in the special case some known results in scalar optimization and improve substantially the few results known in vector case.     

OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION

Abstract

In this paper, we study constrained locally Lipschitz vector optimization problems in which the objective and constraint spaces are Hilbert spaces, the decision space is a Banach space, the dominating cone and the constraint cone may be with empty interior. Necessary optimality conditions for this type of optimization problems are derived. A sufficient condition for the existence of approximate efficient solutions to a general vector optimization problem is presented. Necessary conditions for approximate efficient solutions to a constrained locally Lipschitz optimization problem is obtained.     

Painlevé–Kuratowski stability of approximate efficient solutions for perturbed semi-infinite vector optimization problems

This paper is concerned with the stability of semi-infinite vector optimization problems (SIVOP) under functional perturbations of both objective functions and constraint sets. First, we establish the Berge-lower semicontinuity and Painlevé–Kuratowski convergence of the constraint set mapping. Then, using the obtained results, we obtain sufficient conditions of Painlevé–Kuratowski stability for approximate efficient solution mapping and approximate weakly efficient solution mapping to the (SIVOP). Furthermore, an application to the traffic network equilibrium problems is also given.     

Modified objective function method in nonsmooth vector optimization over cones

In this paper optimality for a nonsmooth vector optimization problem having generalized cone-invex objective and constraint functions is considered. An equivalent $\eta $ -approximated vector optimization problem is constructed by a modification of the objective function. The relationships between weakly efficient solutions and saddle points of the two problems are studied.     

Asplund空间中非凸向量均衡问题近似解的最优性条件

在Asplund空间中,研究了非凸向量均衡问题近似解的最优性条件.借助Mordukhovich次可微概念,在没有任何凸性条件下获得了向量均衡问题εe-拟弱有效解,εe-拟Henig有效解,εe-拟全局有效解以及εe-拟有效解的必要最优性条件.作为它的应用,还给出了非凸向量优化问题近似解的最优性条件.     

Vector variational-like inequalities and non-smooth vector optimization problems

In this paper, we establish relationships between vector variational-like inequality problems and non-smooth vector optimization problems under non-smooth invexity. We identify the vector critical points, the weakly efficient points and the solutions of the non-smooth weak vector variational-like inequality problems, under non-smooth pseudo-invexity assumptions. These conditions are more general than those existing in the literature.     

Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone

We define weakly minimal elements of a set with respect to a convex cone by means of the quasi-interior of the cone and characterize them via linear scalarization, generalizing the classical weakly minimal elements from the literature. Then we attach to a general vector optimization problem, a dual vector optimization problem with respect to (generalized) weakly efficient solutions and establish new duality results. By considering particular cases of the primal vector optimization problem, we derive vector dual problems with respect to weakly efficient solutions for both constrained and unconstrained vector optimization problems and the corresponding weak, strong and converse duality statements.     

On optimality conditions for vector variational inequalities

Optimality conditions for weak efficient, global efficient and efficient solutions of vector variational inequalities with constraints defined by equality, cone and set constraints are derived. Under various constraint qualifications, necessary optimality conditions for weak efficient, global efficient and efficient solutions in terms of the Clarke and Michel–Penot subdifferentials are established. With assumptions on quasiconvexity of constraint functions sufficient optimality conditions are also given.