锥连续锥拟凹向量函数最大化问题有效解集的连通性

本文讨论了锥连续函数及锥最大下果的性质，在此基础上讨论了锥连续锥拟凹向量函数最大化问题有效解集的连通性，证明了当象集为锥凸集时锥有效解集是连通的。     

自反Banach空间中锥拟凸映射多目标最优化问题锥有效解集的弱连通性

本文在自反Banach空间中引进了锥弱连续映射和点集的弱连通概念．在讨论锥弱连续和锥拟凸映射以及锥最小上界的几个性质的基础上,证明了当象集为锥凸集时定义在自反Ba- nach空间中的有界闭凸集上的锥弱连续和锥拟凸映射多目标最优化问题的锥有效解集是弱连通的．     

拓扑空间中锥拟凸映射多目标优化问题有效解集的连通性

本文研究拓扑空间中锥拟凸多目标优化问题的有效解集的连通性．在目标映射是上连续和拟凸(次严格拟凸)的条件下，证明了锥弱有效(有效)解集是连通的.进一步，在是连续和强拟凸的条件下，证明了锥有效解集是路连通的.     

约束锥扰动多目标规划锥有效解集的闭性和半连续性

本文研究拓扑向量空间中目标映射和约束映射均为连续,约束映射的约束锥为半连续的条件下,受扰动可达目标集的锥有效点集和锥弱有效点集的闭性、半连续性和锥半连续性.在此基础上,得到了约束锥扰动多目标规划问题的锥有效解集和锥弱有效解集的闭性和半连续性.     

锥有效拟凹集的有效点集的连通性

本文引进了锥有效拟凹集的概念，讨论了R ^m-严格拟凹与R ^m－有效拟凹的关系，证明了一个紧集为锥有效拟凹且其有效点集为闭集时，这个有效点集是连通的。     

拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性(英文)

本文研究局部凸的拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性问题.证明了定义在紧凸集上目标映射为一对一的锥拟凸多目标规划的锥有效解集是连通的.在证明中,广义鞍点定理起着关键的作用.     

锥上半连续锥拟凸集值映射多目标优化超有效解集的连通性

本文研究集值映射多目标优化超有效解集的连通性,在目标映射为锥上半连续和锥拟凸的条件下,证明了其超有效解集是连通的.     

弱锥2有效集连通性的一个等价定理

利用连通集上有关上半连续点集映射的连通性质，本文证明了拓扑向量空间中向量最优化问题的弱锥－有效解集与相应目标空间中的弱锥－有效点集连通性之间的一个等价定理．     

拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性

本文研究局部凸的Hausdorff拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性问题。利用广义鞍点定理,证明了目标映射为一对一的锥拟凸多目标规划的锥有效解集是连通的。     

具强制条件的向量均衡问题

研究锥伪单调、锥拟凸和上锥连续映射在某种强制性条件下的向量均衡问题解集的特征,建立强制性条件与向量均衡问题解集的关系,得到对偶向量均衡问题局部解集含于向量均衡问题解集的性质和向量均衡问题解集的非空性条件,给出在锥伪单调、锥拟凸和上锥连续映射条件下向量均衡问题解集的非空有界性与强制性条件的等价性．     

锥—连续凸映射的严有效解连通性

本文介绍了严有效解的概念,并在[1]工作的基础上进一步研究了锥连续拟凸映射的严有效的连通性。     

Characterizing Nonemptiness and Compactness of the Solution Set of a Convex Vector Optimization Problem with Cone Constraints and Applications

In this paper, we characterize the nonemptiness and compactness of the set of weakly efficient solutions of a convex vector optimization problem with cone constraints in terms of the level-boundedness of the component functions of the objective on the perturbed sets of the original constraint set. This characterization is then applied to carry out the asymptotic analysis of a class of penalization methods. More specifically, under the assumption of nonemptiness and compactness of the weakly efficient solution set, we prove the existence of a path of weakly efficient solutions to the penalty problem and its convergence to a weakly efficient solution of the original problem. Furthermore, for any efficient point of the original problem, there exists a path of efficient solutions to the penalty problem whose function values (with respect to the objective function of the original problem) converge to this efficient point.     

锥弱有效解的本质集和本质连通区

对于多目标规划问题,通过引入锥弱有效解集的概念,证明了任何连续有界泛函至少存在一个极小本质集和一个本质连通区.     

Connectedness of Henig Weakly Efficient Solution Set for Set-Valued Optimization Problems

In this paper, we study Henig weakly efficient solutions for set-valued optimization problems. The connectedness of the Henig weakly efficient solution set is proved under the condition that the objective function be a cone-arcwise connected set-valued mapping. As an application of the result, we establish the connectedness of the set of super efficient solutions.     

Weakly and properly nonessential objectives in multiobjective optimization problems

In this work we characterize objective functions which do not change the set of efficient solutions (weakly efficient solutions, properly efficient solutions). Necessary and sufficient conditions for an objective function to be weakly nonessential (properly nonessential) are presented. We establish relations between weakly nonessential, properly nonessential and nonessential functions.     

Solution concepts in vector optimization: a fresh look at an old story

Over the past decades various solution concepts for vector optimization problems have been established and used: among them are efficient, weakly efficient and properly efficient solutions. In contrast to the classical approach, we define a solution to be a set of efficient solutions on which the infimum of the objective function with respect to an appropriate complete lattice (the space of self-infimal sets) is attained. The set of weakly efficient solutions is not considered to be a solution, but weak efficiency is essential in the construction of the complete lattice. In this way, two classic concepts are involved in a common approach. Several different notions of semicontinuity are compared. Using the space of self-infimal sets, we can show that various originally different concepts coincide. A Weierstrass existence result is proved for our solution concept. A slight relaxation of the solution concept yields a relationship to properly efficient solutions.     

Efficient and weakly efficient solutions for the vector topical optimization

In this paper, we consider some scalarization functions, which consist of the generalized min-type function, the so-called plus-Minkowski function and their convex combinations. We investigate the abstract convexity properties of these scalarization functions and use them to identify the maximal points of a set in an ordered vector space. Then, we establish some versions of Farkas type results for the infinite inequality system involving vector topical functions. As applications, we obtain the necessary and sufficient conditions of efficient solutions and weakly efficient solutions for a vector topical optimization problem, respectively.     

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.