近似次微分刻画的约束向量均衡问题的最优性条件北大核心CSCD

该文研究一类约束向量均衡问题(CVEP)近似拟弱有效解的最优性条件和对偶定理.首先,建立了问题(CVEP)近似拟弱有效解关于近似次微分形式的最优性必要条件.其次,引入了一种广义凸性的概念,称之为近似伪拟type-I函数,并在其假设下,获得了问题(CVEP)近似拟弱有效解的最优性充分条件.最后,引入了问题(CVEP)的广义近似Mond-Weir对偶模型,并建立其与原问题间关于近似拟弱有效解的对偶定理.     

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

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

集值优化问题在有效意义下的最优性条件

本文在赋范空间中,讨论集值优化问题的有效元导数型最优性条件.当目标映射和约束映射的下方向导数存在时,在近似锥次类凸假设下利用有效点的性质和凸集分离定理得到了集值优化问题有效元导数型Kuhn-Thcker必要条件,在可微Г-拟凸性的假设下得到了Kuhn-Tucker最优性充分条件;此外利用集值映射沿弱方向锥的导数的特性给出了有效解最优性的另一种刻画.     

不可微向量优化问题严有效解的最优性条件

本文研究向量优化问题在严有效解意义下的最优性条件.在局部凸Hausdorff拓扑线性空间中.在近似锥一次类凸假设下,利用凸集分离定理得到了最优性必要条件.借助Gateaux导数引进了几种新的凸性,在新的凸性假设下得到了最优性充分条件.     

鲁棒凸优化问题拟近似解的刻划

本文研究鲁棒凸优化问题拟近似解的最优性条件和对偶理论.首先利用鲁棒优化方法,在由约束函数的共轭函数的上图给出的闭凸锥约束规格条件下,建立了拟近似解的最优性充要条件.其次给出了鲁棒凸优化问题拟近似解在Wolf型和Mond-weir型对偶模型下的强(弱)对偶定理.最后给出具体实例验证了本文获得的结果.     

拟凸函数的近似次微分及其在多目标优化问题中的应用

针对拟凸函数提出一类新的近似次微分,研究其性质,并将近似次微分应用到拟凸多目标优化问题近似解的刻画中.首先,对已有的近似次微分进行改进,得到拟凸函数新的近似次微分,并给出其与已有次微分之间的关系及一系列性质.随后,利用新的近似次微分给出拟凸多目标优化问题近似有效解、近似真有效解的最优性条件.     

广义弧式连通凸锥优化问题的最优性条件及对偶问题

给出了弧式连通凸锥优化问题的强有效解和Benson真有效解的最优性条件,讨论了目标函数和约束函数均为广义弧式连通凸锥函数优化问题的近似有效解的最优性条件,给出了相应的近似Mond-Weir型对偶模型,给出了弱对偶和逆对偶定理.     

不确定多目标优化鲁棒真有效解的最优性与对偶

本文研究一类不确定性多目标优化问题鲁棒真有效解的最优性条件和对偶理论.首先,借助鲁棒真有效解的标量化定理,在鲁棒型闭凸锥约束品性下,建立了不确定多目标优化问题真有效解的最优性条件;其次,针对原不确定多目优化的Wolfe型对偶问题,得到关于鲁棒真有效解的强、弱对偶定理.     

多目标优化问题Proximal真有效解的最优性条件

在广义凸性假设下,给出了集合proximal真有效点的线性标量化,并在此基础上证明了它与Benson真有效点和Borwein真有效点的等价性.将这些结果应用到多目标优化问题上,得到proximal真有效解的最优性条件.最后,利用proximal次微分,得到了proximal真有效解的模糊型最优性条件.     

集值优化问题强有效解的Kuhn Tucker最优性条件

在局部凸空间中考虑集值优化问题（VP）在强有效解意义下的Kuhn-Tucker最优性条件．在近似锥．次类凸假设下利用择一性定理得到了（VP）取得强有效解的必要条件，利用基泛函的性质给出了（VP）取得强有效解的充分条件，最后给出了一种与（VP）等价的无约束规划。     

集值优化全局真有效解的最优性条件

本文引进集值映射的全局真有效次微分的概念,并用它得到了约束集值优化问题全局真有效解在集值映射的支撑函数和Lagrange乘子形式下的最优性必要条件.     

集值映射的广义梯度和全局真有效解

本文利用集值映射的上图导数引进了全局真有效意义下的广义梯度和广义次微分的概念，并且给出了集值映射全局真有效次微分的存在定理，还建立了集值向量优化问题全局真有效解在次微分形式下的最优性条件．     

Globally proper saddle point in ic-cone-convexlike set-valued optimization problems

The existence conditions of globally proper efficient points and a useful property of ic- cone-convexlike set-valued maps are obtained. Under the assumption of the ic-cone-convexlikeness, the optimality conditions for globally proper efficient solutions are established in terms of Lagrange multipliers. The new concept of globally proper saddle-point for an appropriate set-valued Lagrange map is introduced and used to characterize the globally proper efficient solutions. The results which are obtained in this paper are proven under the conditions that the ordering cone need not to have a nonempty interior.     

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.     

Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity

In this paper a new class of generalized vector-valued arcwise connected functions, termed sub-arcwise connected functions, is introduced. The properties of sub-arcwise connected functions are derived. The approximate quasi efficient solutions of vector optimization problems are studied, and the necessary and sufficient optimality conditions are obtained under the assumption of arcwise connectivity. An approximate Mond-Weir type dual problem is formulated and the duality theorems are established.     

非凸多目标优化模型的一类鲁棒逼近最优性条件

通过引入一类非凸多目标不确定优化问题，借助鲁棒优化方法，先建立了该不确定多目标优化问题的鲁棒对应模型；再借助标量化方法和广义次微分性质，刻画了该不确定多目标优化问题的鲁棒拟逼近有效解的最优性条件，推广和改进了相关文献的结论.     

New optimality conditions for unconstrained vector equilibrium problem in terms of contingent derivatives in Banach spaces

This article presents necessary and sufficient optimality conditions for weakly efficient solution, Henig efficient solution, globally efficient solution and superefficient solution of vector equilibrium problem without constraints in terms of contingent derivatives in Banach spaces with stable functions. Using the steadiness and stability on a neighborhood of optimal point, necessary optimality conditions for efficient solutions are derived. Under suitable assumptions on generalized convexity, sufficient optimality conditions are established. Without assumptions on generalized convexity, a necessary and sufficient optimality condition for efficient solutions of unconstrained vector equilibrium problem is also given. Many examples to illustrate for the obtained results in the paper are derived as well.     

Approximate Optimality and Approximate Duality for Quasi Approximate Solutions in Robust Convex Semidefinite Programs

In this paper, we study quasi approximate solutions for a convex semidefinite programming problem in the face of data uncertainty. Using the robust optimization approach (worst-case approach), approximate optimality conditions and approximate duality theorems for quasi approximate solutions in robust convex semidefinite programming problems are explored under the robust characteristic cone constraint qualification. Moreover, some examples are given to illustrate the obtained results.     

群体多目标决策联合有效解类的不变凸充分条件

对于群体多目标决策问题，文[1]引进它的联合有效解类的概念，并给出这类解的最优性必要条件，在对于问题的目标函数和约束函数附加凸性的条件下，文[2]又给出了联合有效解类的最优性充分条件，本文进一步在目标函数和约束函数具不变凸和不变广义 凸的情况下，分别给出了联合有效解类的若干最优性充分条件。