向量优化问题有效点集的稳定性

在不需要紧性假设下,利用拟C-凸函数及回收锥的性质,建立了向量优化问题有效点集的稳定性, 获得了一列目标函数和可行集均扰动情形下的向量优化问题与对应的向量优化问题有效点集的Painlevé Kuratowski内收敛性结果．所得结果推广和改进了相关文献(Attouch H, Riahi H. Stability results for Ekeland’s ε-variational principle and cone extremal solution; Huang X X. Stability in vector-valued and set-valued optimization)中的相应结果, 并给出例子说明了所得结果的正确性.     

向量优化问题有效点集的稳定性

在不需要紧性假设下,利用拟C-凸函数及回收锥的性质,建立了向量优化问题有效点集的稳定性,获得了一列目标函数和可行集均扰动情形下的向量优化问题与对应的向量优化问题有效点集的Painlevé-Kuratowski内收敛性结果。所得结果推广和改进了相关文献(Attouch H,RiahiH.Stability results for Ekeland’s-variational principle and cone extremal solution;Huang X X.Stabilityin vector-valued and set-valued optimization)中的相应结果,并给出例子说明了所得结果的正确性。     

可允许集上的广义向量拟均衡问题

主要讨论可允许集上的广义向量拟均衡问题,推广L in的一些结果.     

集值映射的广义对称向量拟平衡问题

本文提出了一类集值映射的广义对称向量拟平衡问题．利用非线性标量化函数,分别在局部凸Hausdorff拓扑向量空间和一般的Hausdorff拓扑向量空间中,证明了广义对称向量拟平衡问题解的存在性定理．     

目标函数扰动的集值优化问题的稳定性

本文研究了由目标函数扰动的集值优化问题的有效点集所定义的集值映射的半连续性.讨论了目标函数扰动的集值优化问题在上半连续意义下的稳定性.特别地,在广义适定性条件下,证明了集值优化问题在上半连续意义下的稳定性.     

向量优化问题的近似解研究

向量优化是数学规划领域中十分重要的研究方向之一,其相关基础理论与基本方法的研究具有非常重要的理论意义与应用价值.近年来,关于近似解的定义及其性质研究已成为向量优化理论与方法研究的热点.现主要介绍国内学者,特别是我们团队在向量优化问题的各类近似解和统一解概念及其发展和各类近似解与统一解的性质研究方面取得的一些重要进展.最后,提出了与向量优化问题的近似解与统一解相关的一些公开问题.     

含参广义集值强向量平衡问题的稳定性

本文借助集合极限的性质和弱f-性假设证明了含参广义集值强向量平衡问题解集映射的下半连续性,其方法不同于最近文献(Zhao,2016和Meng,2018).此外,建立了含参广义集值强向量平衡问题解集连通性的充分条件,并举例验证了所得结果的正确性.本文得结果推广和改进了已有文献(Gong,2008,Xu,2009,Chen,2010,Xu,2013和Zhao,2013)中相应结果.     

多目标对策的弱Pareto-Nash平衡点集的稳定性研究

通过定义多目标对策的加权Nash平衡点集,得出它和对应对策的弱Pareto-Nash平衡点集之间的关系,证明了在一定条件下的多目标对策的弱Pareto-Nash平衡点集的稳定性.     

广义向量拟平衡问题解集映射的稳定性

我们在局部凸Hausdorff拓扑向量空间中,讨论了广义向量拟平衡问题解集映射的上半连续性以及闭性,并利用扰动间隙函数证明解集的Hausdorff下半连续性.     

集值映射的Nash平衡点集的通有稳定性

本文讨论了集值映射的Nash平衡点的存在及平衡点集的通有稳定性,得到大多数的集值映射的Nash平衡点集是稳定的。     

Vector Optimization Problems via Improvement Sets

Motivated by applications to the real world, various optimality criteria (also approximate ones) are developed for situations in vector optimization. We propose a new type of solution based on upper comprehensive sets and we discuss the existence of optimal points in multicriteria situations.     

离散扰动下向量均衡问题的稳定性

利用集合序列P—K收敛的概念,讨论了离散扰动下的向量均衡问题弱有效解的稳定性．提出了一个新的向量均衡问题的极小化序列的概念．给出了各种充分条件以确保集合的包含关系,并举例阐述相应的结论．     

Well-Posedness Under Relaxed Semicontinuity for Bilevel Equilibrium and Optimization Problems with Equilibrium Constraints

Bilevel equilibrium and optimization problems with equilibrium constraints are considered. We propose a relaxed level closedness and use it together with pseudocontinuity assumptions to establish sufficient conditions for well-posedness and unique well-posedness. These conditions are new even for problems in one-dimensional spaces, but we try to prove them in general settings. For problems in topological spaces, we use convergence analysis while for problems in metric cases we argue on diameters and Kuratowski’s, Hausdorff’s, or Istrǎtescu’s measures of noncompactness of approximate solution sets. Besides some new results, we also improve or generalize several recent ones in the literature. Numerous examples are provided to explain that all the assumptions we impose are very relaxed and cannot be dropped.     

带约束条件集值优化问题近似Henig有效解集的连通性

研究了带约束条件集值优化问题近似Henig有效解集的连通性.在实局部凸Hausdorff空间中,讨论了可行域为弧连通紧的,目标函数为C-弧连通的条件下,带约束条件集值优化问题近似Henig有效解集的存在性和连通性.并给出了带约束条件集值优化问题近似Henig有效解集的连通性定理.     

Convergence Results for Weak Efficiency in Vector Optimization Problems with Equilibrium Constraints

In this paper, we consider weak efficiency in vector optimization problems with equilibrium constraints. We obtain results on the convergence of the marginal map, the value, and the solution sets. This research was supported by Hong Kong Polytechnic University under Grant G-YY33 and by National Science Foundation of China under Grant 10401043. The authors express their gratitude to Professor Guangya Chen for careful reading of an earlier version of this paper. The authors are grateful to the anonymous referees for helpful comments and constructive suggestions.     

Vector Equilibrium Problems Under Asymptotic Analysis

Given a closed convex set K in Rⁿ; a vector function F:K×K R^m; a closed convex (not necessarily pointed) cone P(x) in ^m with non-empty interior, PP(x) Ø, various existence results to the problemfind xK such that F(x,y)- int P(x) y K under P(x)-convexity/lower semicontinuity of F(x,) and pseudomonotonicity on F, are established. Moreover, under a stronger pseudomonotonicity assumption on F (which reduces to the previous one in case m=1), some characterizations of the non-emptiness of the solution set are given. Also, several alternative necessary and/or sufficient conditions for the solution set to be non-empty and compact are presented. However, the solution set fails to be convex in general. A sufficient condition to the solution set to be a singleton is also stated. The classical case P(x)=^m ₊ is specially discussed by assuming semi-strict quasiconvexity. The results are then applied to vector variational inequalities and minimization problems. Our approach is based upon the computing of certain cones containing particular recession directions of K and F.     

On Convergence Results for Weak Efficiency in Vector Optimization Problems with Equilibrium Constraints

In this note, we prove that the convergence results for vector optimization problems with equilibrium constraints presented in Wu and Cheng (J. Optim. Theory Appl. 125, 453–472, 2005) are not correct. Actually, we show that results of this type cannot be established at all. This is due to the possible lack, even under nice assumptions, of lower convergence of the solution map for equilibrium problems, already deeply investigated in Loridan and Morgan (Optimization 20, 819–836, 1989) and Lignola and Morgan (J. Optim. Theory Appl. 93, 575–596, 1997).     

On Efficiency Conditions for Nonsmooth Vector Equilibrium Problems with Equilibrium Constraints

In this article, necessary conditions of Fritz John type for weak efficient solutions of a nonsmooth vector equilibrium problem involving equilibrium constraints (VEPEC) in terms of the Clarke subdifferentials are established. Under constraint qualifications which are suitable for (VEPEC), necessary conditions of Kuhn-Tucker type for efficiency are derived. Under assumptions on generalized convexity of data, sufficient conditions for efficiency are developed. Some applications to vector variational inequalities and vector optimization problems with equilibrium constraints are also given.     

Optimality Conditions for D.C. Vector Optimization Problems Under Reverse Convex Constraints

In this paper, we establish global necessary and sufficient optimality conditions for D.C. vector optimization problems under reverse convex constraints. An application to vector fractional mathematical programming is also given. Mathematics Subject Classifications (1991). Primary 90C29, Secondary 49K30.