集值映射向量优化问题的锥弱有效解的镇定性和稳定性

本文研究了集值映射向量优化问题的锥弱有效解的镇定性和稳定性,我们引进了集值映射向量优化问题的镇定性和稳定性的定义,并证明了集值映射问题优化问题的镇定性和稳定性的一些主要定理。     

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

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

集值向量优化问题ε-弱有效集的拓扑性质

本文研究集值向量优化问题ε-弱有效集的拓扑性质，证明了ε-弱有效解集的存在性、闭性、紧性和连通性。     

集值映射向量优化问题的锥弱有效解的镇定性和稳定性(英文)

本文研究了集值映射向量优化问题的锥弱有效解的镇定性和稳定性,我们引进了集值映射向量优化问题的镇定性和稳定性的定义,并证明了集值映射向量优化问题的镇定性和稳定性的一些主要定理.     

一类集值映射向量优化问题的ε-有效解

集值映射向量优化问题是最优化理论中的一个重要方向.在集值映射为生成锥内部-锥一类凸(简记为ic-锥类凸)的假设条件下,利用择一定理,给出了集值映射向量优化问题ε-弱有效解和ε-有效解的最优性条件和ε-Lagrange乘子定理,是弱有效解和有效解相应结果的推广.     

关于集值优化问题的若干结果

引入了集值集值C-τ-半预不变凸概念，证明了集值集值C-τ-半预不变凸优化问题的局部弱有效元是弱有效元，给出了集值预不变凸变分不等式作为集值C-τ-半预不变凸优化问题的充分条件和必要条件，这些结果推广了文[1-4]的相应结果。     

集值映射向量优化的Benson真有效性

本文首先将单值映射的锥次类凸概念推广到集值映射，并对锥次类凸集值映射给出几个等价刻划和一个择一性定理。然后，利用这些概念与结果来确定拓扑线性空间中带集值映射的向量优化问题的Ｂｅｎｓｏｎ真有效性，获得两个标量化结果和两个Ｌａｇｒａｎｇｅ乘子定理，在定义了一个适当的集值Ｌａｇｒａｎｇｅ映射并对其引入真鞍点的概念之后，又建立了Ｂｅｎｓｏｎ真有效性的一个充分条件和一个充要条件，最后还讨论了两个对偶问题。     

用广义梯度刻画集值优化Benson真有效解

在锥偏序Banach空间中引入了一类关于集值映射的广义梯度，借助锥分离定理证明了广义梯度的存在性，由此崦给出集值向量优化Benson真有效解的特征。     

集值映射向量优化问题的精确罚函数镇定性和稳定性（英文）

精确罚函数理论中镇定性和稳定性是非常重要的条件,因为它们是判断精确罚函数的充分必要条件,本文基于集值映射向量优化问题的锥弱有效解,提出它们的镇定性和稳定性概念,并讨论它们的性质,证明在这些概念下集值向量优化问题的罚函数精确性.     

超有效意义下向量集值优化修整的Lagrange乘子型对偶

给出了一类加细的向量集值优化超有效解的最优性条件,由此给出了一种改进的Lagrange乘子型对偶,并建立了对偶的弱定理,正定理及逆定理。     

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.     

Convergence Results for Henig Proper Efficient Solution Sets of Vector Optimization Problems

In this article, we discuss the convergence of Henig proper minimal point sets and Henig proper efficient solution sets for (strict) proper quasi-convex vector optimization problems when the data of the perturbed problems converges to the data of the original problem in the sense of Painlevé-Kuratowski. Our main results are new and different from those in the literature.     

Nearly Subconvexlike Set-Valued Maps and Vector Optimization Problems

This paper gives several characterizations of nearly subconvexlike set-valued maps (see Ref. 1) and shows that a weakly efficient solution and a Benson properly efficient solution of a vector optimization problem with nearly-subconvexlike objectives and constraints can be expressed in terms of saddle points defined in a suitable sense.     

Proper Efficiency in Vector Optimization on Real Linear Spaces

In this paper, we use an algebraic type of closure, which is called vector closure, and through it we introduce some adaptations to the proper efficiency in the sense of Hurwicz, Benson, and Borwein in real linear spaces without any particular topology. Scalarization, multiplier rules, and saddle-point theorems are obtained in order to characterize the proper efficiency in vector optimization with and without constraints. The usual convexlikeness concepts used in such theorems are weakened through the vector closure.     

Some Remarks On Vector Optimization Problems

We prove the existence of a weak minimum for vector optimization problems by means of a vector variational-like inequality and preinvex mappings.     

Benson Proper Efficiency in the Vector Optimization of Set-Valued Maps

This paper extends the concept of cone subconvexlikeness of single-valued maps to set-valued maps and presents several equivalent characterizations and an alternative theorem for cone-subconvexlike set-valued maps. The concept and results are then applied to study the Benson proper efficiency for a vector optimization problem with set-valued maps in topological vector spaces. Two scalarization theorems and two Lagrange multiplier theorems are established. After introducing the new concept of proper saddle point for an appropriate set-valued Lagrange map, we use it to characterize the Benson proper efficiency. Lagrange duality theorems are also obtained     

广义函数Denjoy积分的收敛性问题

本文讨论广义函数De njoy积分的收敛性问题.首先给出了广义Denjoy可积函数空间中强收敛、弱收敛、弱~*收敛和广义函数Denjoy积分收敛的关系;证明拟一致收敛是广义函数Denjoy积分收敛的一个充分必要条件;最后指出了Denjoy可积广义函数列弱~*收敛与强收敛等价当且仅当原函数等度连续.     

Hartley Proper Efficiency in Multiobjective Optimization Problems with Locally Lipschitz Set-valued Objectives and Constraints

In this paper we give necessary conditions for Hartley proper efficiency in a vector optimization problem whose objectives and constraints are described by nonconvex locally Lipchitz set-valued maps. The obtained necessary conditions are written in terms of a Lagrange multiplier rule. Our approach is based on a reduction theorem which leads the problem of studying proper efficiency to a scalar optimization problem whose objective is given by a function of max-type. Sufficient conditions for Hartley proper efficiency are also considered.     

约束向量优化问题的Fenchel-Lagrange对偶及鞍点

The aim of this paper is to apply a perturbation approach to deal with Fenchel- Lagrange duality based on weak efficiency to a constrained vector optimization problem. Under the stability criterion, some relationships between the solutions of primal problem and the Fenchel-Lagrange duality are discussed. Moreover, under the same condition, two saddle-points theorems are proved.     

Characterizations of the Benson Proper Efficiency for Nonconvex Vector Optimization

Under generalized cone-subconvexlikeness for vector-valued mappings in locally-convex Hausdorff topological vector spaces, a Gordan-form alternative theorem is derived. Some characterizations of the Benson proper efficiency under this generalized convexity are established in terms of scalarization, Lagrangian multipliers, saddle-point criterion, and duality.