多目标锥—广义凸规划有效解的充要条件

本文提出了ｎ维欧氏空间上的锥－凸、锥－伪凸、锥－拟凸向量值函数的概念，讨论了它们之间的关系，并在此基础上，对多目标数学规划问题关于凸锥∧有效解，撇开约束品性，讨论了它的充分必要条件。     

集值映射最优化问题的严有效解集的连通性及应用

本文对集值映射最优化问题引入严有效解的概念．证明了当目标函数为锥类凸的集值映射时,其目标空间里的严有效点集是连通的;若目标函数为锥凸的集值映射时,其严有效解集也是连通的．作为应用,讨论了超有效解集的连通性．     

B值鞅不等式与Banach空间几何性质的刻划

本文建立了Ｂ值鞅的极大函数ｆ，平削函数ｆｐ＾＃，ｆｐ＾＃的凸Φ－不等式，反过来用这些不等式刻划了Ｂａｎａｃｈ空间的凸性和光滑性，同时给出了超自反空间以及与Ｈｉｌｂｅｒｔ空间同构的Ｂａｎａｃｈ空间的特征。本文的结论推广了一些熟知的重要结果。     

连续化方法求解一般非凸规划的K-K-T点

对较一般的非凸规划的K－K－T方程组，构造了一种连续化内点同伦，并且分析了收敛于此类规划K－K－T点的同伦解曲线及其求解方法，数值结果亦图示了这些理论结果，值得一提的是这种方法削弱了冯果忱等人（1998）的假设条件－外法锥条件。     

Banach空间具有Banach—Saks性质的一个充分条件

本文的目标是利用凸性指标给出Ｂａｎａｃｈ空间具有Ｂａｎａｃｈ－Ｓａｋｅ性质的一个充分条件，从而推广Ｋａｎｋｕｔａｎｉ定理。     

关于K—极凸Banach空间

引进Ｋ－极凸Ｂａｎａｃｈ空间，证明了ＸＫ－极凸当且仅当Ｘ自反、Ｋ－严格凸且有（Ｈ）性质，得到了Ｋ－极凸空间的一些性质，并讨论了Ｋ－极凸与Ｋ－Ｋ－强光滑、Ｋ－一致凸及完全Ｋ－凸的关系。     

K-强凸性与K-强光滑性

本文引进了Ｋ－强凸性的概念，它是强凸性概念的推广．然后证明了Ｋ－强凸性与Ｋ－强光滑具有对偶性质；Ｘ为Ｋ－强光滑当且仅当Ｘ是自反且Ｋ－强凸；自反的Ｂａｎａｃｈ空间Ｘ是Ｋ－强凸当且仅当Ｘ是Ｋ－严格凸且具有（Ｈ）性质；局部Ｋ－一致凸空间是Ｋ－强凸的，从而推广了文［２－４］的结果．最后利用Ｋ－强暴露点的概念刻划了Ｋ－强光滑空间的特征，从而推广了［７］的结果．     

紧—凸性与紧—光滑性

本文首先通过暴露集和暴露泛函的概念引入卫闭凸集的紧－严格凸、紧－强凸、紧－一致凸及紧－非常凸等概念。用对偶映射给出了Ｂａｎａｃｈ空间的两种新光滑性－紧－一致光滑与紧－非常光滑。然后特别研究了Ｂａｎａｃｈ空间的紧－非常凸与紧－非常光滑。此外还得到关于对偶映射的两个新结果。     

RLW—Burgers方程的精确解

借助未知函数的变换，ＲＬＷ－Ｂｕｒｇｅｒｓ方程和ＫｄＶ－Ｂｕｒｇｅｒｓ方程化为易于求解的齐次形式的方程，从而得到ＲＬＷ－Ｂｕｒｇｅｒｓ方程和ＫｄＶ－Ｂｕｒｇｅｒｓ方程的精确解。     

集值映射向量优化问题的ε—超有效解

本文引进了集值映射向量优化问题的ε－超有效解概念,并在集值映射为近似广义锥次似凸的假设下,建立了关于ε－超有效解的标量化定理和Lagrange乘子定理。     

关于真有效点集的连通性

在局部有界的Ｈａｕｓｄｏｒｆｆ局部凸空间中讨论了集合的真有效点集的连通性问题。证明了当序锥具有基底时,任何非空紧凸集的真有效点集是连通的。     

ON THE THEOREM OF ARROW-BARANKIN-BLACKWELL FOR WEAKIY COMPACT CONVEX SET

ＯＮＴＨＥＴＨＥＯＲＥＭＯＦＡＲＲＯＷ－ＢＡＲＡＮＫＩＮ－ＢＬＡＣＫＷＥＬＬＦＯＲＷＥＡＫＩＹＣＯＭＰＡＣＴＣＯＮＶＥＸＳＥＴ￥ＦＵＷＡＮＴＡＯＡｂｓｔｒａｃｔ：ＴｈｉｓｐａｐｅｒｓｔｕｄｉｅｓｔｈｅｋｎｏｗｎｄｅｎｓｉｔｙｔｈｅｏｒｅｍｏｆＡｒｒｏ...     

ON THE THEOREM OF ARROW-BARANKIN-BLACKWELL FOR WEAKLY COMPACT CONVEX SET

This papeer studies the known density theorem of Arrow-Barankin-Blackwell. The following main result is obtained: If X is a Hausdorff locally convex Topological space and C belong to X is a closed convex cone with bounded base, then for every nonempty weakly compact convex subset A, the set of positive proper efficient points of A is dense in the set of efficient points of A.     

Generalized Proximal Method for Efficient Solutions in Vector Optimization

This article is devoted to developing the generalized proximal algorithm of finding efficient solutions to the vector optimization problem for a mapping from a uniformly convex and uniformly smooth Banach space to a real Banach space with respect to the partial order induced by a pointed closed convex cone. In contrast to most published literature on this subject, our algorithm does not depend on the nonemptiness of ordering cone of the space under consideration and deals with finding efficient solutions of the vector optimization problem in question. We prove that under some suitable conditions the sequence generated by our method weakly converges to an efficient solution of this problem.     

Optimality conditions of the set-valued optimization problem with generalized cone convex set-valued maps characterized by contingent epiderivative

In this paper, firstly, a new notion of generalized cone convex set-valued map is introduced in real normed spaces. Secondly, a property of the generalized cone convex set-valued map involving the contingent epiderivative is obtained. Finally, as the applications of this property, we use the contingent epiderivative to establish optimality conditions of the set-valued optimization problem with generalized cone convex set-valued maps in the sense of Henig proper efficiency. The results obtained in this paper generalize and improve some known results in the literature.     

Connectedness of efficient points in convex and convex transformable vector optimization

Given a convex vector optimization problem with respect to a closed ordering cone, we show the connectedness of the efficient and properly efficient sets. The Arrow–Barankin–Blackwell theorem is generalized to nonconvex vector optimization problems, and the connectedness results are extended to convex transformable vector optimization problems. In particular, we show the connectedness of the efficient set if the target function f is continuously transformable, and of the properly efficient set if f is differentiably transformable. Moreover, we show the connectedness of the efficient and properly efficient sets for quadratic quasiconvex multicriteria optimization problems.     

On Some Generalized Polyhedral Convex Constructions

Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal convolution, normal cone, conjugate function, subdifferential are studied thoroughly in this paper. Among other things, we show how a generalized polyhedral convex set can be characterized through the finiteness of the number of its faces. In addition, it is proved that the infimal convolution of a generalized polyhedral convex function and a polyhedral convex function is a polyhedral convex function. The obtained results can be applied to scalar optimization problems described by generalized polyhedral convex sets and generalized polyhedral convex functions.     

Some Geometrical Aspects of Efficient Points in Vector Optimization

We study efficient point sets in terms of extreme points, positive support points and strongly positive exposed points. In the case when the ordering cone has a bounded base, we prove that the efficient point set of a weakly compact convex set is contained in the closed convex hull of its strongly positive exposed points, thereby extending the Phelps theorem. We study also the density of positive proper efficient point sets. This research was supported by a Central Research Grant of Hong Kong Polytechnic University, Grant G-T 507. Research of the first author was also supported by the National Natural Science Foundation of P.R. China, Grant 10361008, and the Natural Science Foundation of Yunnan Province, China, Grant 2003A002M. Research of the second author was also supported by the Natural Science Foundation of Chongqing. Research of the third author was supported by a research grant from Australian Research Counsil.     

Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems

In this paper, we first establish characterizations of the nonemptiness and compactness of the set of weakly efficient solutions of a convex vector optimization problem with a general ordering cone (with or without a cone constraint) defined in a finite dimensional space. Using one of the characterizations, we further establish for a convex vector optimization problem with a general ordering cone and a cone constraint defined in a finite dimensional space the equivalence between the nonemptiness and compactness of its weakly efficient solution set and the generalized type I Levitin-Polyak well-posednesses. Finally, for a cone-constrained convex vector optimization problem defined in a Banach space, we derive sufficient conditions for guaranteeing the generalized type I Levitin-Polyak well-posedness of the problem.