序扰动多目标规划的锥次微分稳定性

对于局部凸拓扑向量空间的多目标规划问题,本文研究并得到当确定空间序的控制锥受扰动,它们的锥有效点（解）集和锥弱有效点（解）集分别在锥次微分和锥弱次微分意义下的稳定性结果.     

Banach空间扰动集值映射最优化的锥次微分稳定性

本文研究Ｂａｎａｃｈ空间中扰动集值映射最优化的稳定性问题,在目标映射和约束映射均为半连续和锥凸的条件下,得到了扰动问题的锥有效点集和锥弱有效点集分别在锥次秃分和锥弱次微分意义下的稳定性结果。     

扰动多目标规划的次微分稳定性

本文利用共轭对偶算子定义了次微分,在一般拓扑向量空间中系统地讨论了多目标规划次微分稳定性.在目标函数为锥严格凸,约束函数为拟凸以及锥半连续的条件下,得到扰动多目标规划问题的整体稳定性.另外,通过引进点集,映射在一点凸的定义,得到问题的局部稳定性.我们将所得到的结论应用于有限维欧氏空间中控制结构为正锥的情形,还得到一些特殊结果.     

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

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

多目标规划α—较多有效解的稳定性

本文借助于对非凸的α─较多锥的分解，得到多目标规划的卜较多有效解在半连续意义下的稳定性结果．     

扰动集值优化问题超有效点集的次微分稳定性

在锥序Banach向量空间引入了集值映射在超有效意下的次微分(次梯度);在一定的条件下,证明次微分(次梯度)的存在性;得到了序扰动、双扰动集值优化问题超有效点集在次微分意义下的稳定性．     

Banach空间中双扰动超有效性的稳定性(英)

在Ｂａｎａｃｈ空间中讨论了超有效点的稳定性．在半连续的意义下,给出了当约束集和控制锥同时扰动时,超有效点的稳定性．     

集值映射向量优化问题ε-超有效解集的连通性

本文在赋范向量空间中讨论集值映射向量优化问题的ε-超有效性，在锥-半连续和广义锥-次类凸的假设条件下，获得了ε-超有效点(解)集的连通性结果．     

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

运用标量化的方法,通过锥正定真有效解的上半连续性讨论了无限维赋范空间中锥有效解的部分上半连续性,证明了锥有效解的通有稳定性.在此基础上,进一步证明,在Baire纲的意义下,绝大多数的向量优化问题至少存在一个锥正定真有效解是本质的有效解,换句话说,绝大多数的向量优化问题锥有效解是几乎下半连续的.     

关于对偶问题及对偶性质

本文考虑非可微凸规划的一个对偶问题，它使用目标函数的扰动函数的次微分及外法向量锥，它不同于已知结果．我们给出相应的对偶性质．     

On the existence and stability of approximate solutions of perturbed vector equilibrium problems

In this paper we consider several concepts of approximate minima of a set in normed vector spaces and we provide some results concerning the stability of these minima under perturbation of the underlying set with a sequence of sets converging in the sense of Painlevé-Kuratowski to the initial set. Then, we introduce the concept of approximate solution for equilibrium problem governed by set-valued maps and we study the stability of these solutions. The particular case of linear continuous operators is considered as well.     

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

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

Sensitivity analysis in multiobjective optimization

Sensitivity analysis in multiobjective optimization is dealt with in this paper. Given a family of parametrized multiobjective optimization problems, the perturbation map is defined as the set-valued map which associates to each parameter value the set of minimal points of the perturbed feasible set in the objective space with respect to a fixed ordering convex cone. The behavior of the perturbation map is analyzed quantitatively by using the concept of contingent derivatives for set-valued maps. Particularly, it is shown that the sensitivity is closely related to the Lagrange multipliers in multiobjective programming.This research was made while the author stayed at the International Institute for Applied Systems Analysis, Laxenburg, Austria.The author would like to thank an anonymous referee for his helpful suggestions; particularly, he pointed out that Proposition 2.2 and Theorem 2.1 are valid also in infinite-dimensional spaces.     

Stability and sensitivity analysis in multiobjective nonlinear programming

In this paper some results on stability and sensitivity analysis in multiobjective nonlinear programming are surveyed. Given a family of parametrized multiobjective programming problems, the perturbation map is defined as the set-valued map which associates to each parameter value the set of minimal points of the perturbed feasible set with respect to an ordering convex cone. The behavior of the perturbation map is analyzed both qualitatively and quantitatively. First, some sufficient conditions which guarantee the upper and lower semicontinuity of the perturbation map are provided. The contingent derivatives of the perturbation map are also studied. Moreover, it is shown that the results can be refined in the convex case.     

Connectedness of Cone-Efficient Solution Set for Cone-Quasiconvex Multiobjective Programming in Locally Convex Spaces

This paper deals with the connectedness of the cone-efficient solution set for vector optimization inlocally convex Hausdorff topological vector spaces.The connectedness of the cone-efficient solution set is provedfor multiobjective programming defined by a continuous cone-quasiconvex mapping on a compact convex set ofalternatives.The generalized saddle theorem plays a key role in the proof.     

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

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

Duality theory in multiobjective programming

In this paper, a multiobjective programming problem is considered as that of finding the set of all nondominated solutions with respect to the given domination cone. Two point-to-set maps, the primal map and the dual map, and the vector-valued Lagrangian function are defined, corresponding to the case of a scalar optimization problem. The Lagrange multiplier theorem, the saddle-point theorem, and the duality theorem are derived by using the properties of these maps under adequate convexity assumptions and regularity conditions.