On a Class of Generalized Vector Quasiequilibrium Problems with Set-Valued Maps

This paper considers the following generalized vector quasiequilibrium problem: find a point (z ₀,x ₀) of a set E×K such that x ₀∈A(z ₀,x ₀) and

集值映射向量优化问题的ε-超鞍点和ε-对偶定理

本文研究集值映射向量优化问题的ε-超鞍点和ε-对偶定理。在集值映射是近似广义锥次似凸的假设下，利用ε-超有效解的标量化和Lagrange乘子定理，建立和证明了关于ε-超有效解的鞍点和对偶定理。     

Generalized Convexity of Functions and Generalized Monotonicity of Set-Valued Maps

We establish connections between some concepts of generalized monotonicity for set-valued maps introduced earlier and some notions of generalized convexity. Moreover, a notion of pseudomonotonicity for set-valued maps is introduced; it is shown that, if a function f is continuous, then its pseudoconvexity is equivalent to the pseudomonotonicity of its generalized subdifferential in the sense of Clarke and Rockafellar.     

非凸集值映射的包含切性及应用

本文在一般的Ｂａｎａｃｈ空间Ｘ中研究从非空闭集ＫＸ到Ｘ的非凸集值映射Ｆ的包含切性问题．得到的结果定理３．１把有关的结论推广到非光滑空间，定理３．３则将有限维空间的正则性定理推广到任意的Ｂａｎａｃｈ空间．作为结果的应用，我们证明了无穷维非凸微分包含和非凸控制系统生存解的存在性，且给出了一个方便的等价切性条件．     

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

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

Generalized Topological Essentiality and Coincidence Points of Multivalued Maps

A concept of generalized topological essentiality for a large class of multivalued maps in topological vector Klee admissible spaces is presented. Some direct applications to differential equations are discussed. Using the inverse systems approach the coincidence point sets of limit maps are examined. The main motivation as well as main aim of this note is a study of fixed points of multivalued maps in Fréchet spaces. The approach presented in the paper allows to check not only the nonemptiness of the fixed point set but also its topological structure.      

关于广义函数赋值问题的完善与积分问题

本文采用非标准分析方法，首先对广义函数的赋值问题进行了完善；接着界定了广义函数的积分；最后讨论了广义函数的广义连续性．     

Comment on “The Steiner number of a graph” by G. Chartrand and P. Zhang: [Discrete Mathematics 242 (2002) 41–54]

We show by counterexample that one of the main results in the paper “The Steiner number of a graph” by Chartrand and Zhang (Disc. Math. 242 (2002) 41–54) does not hold. To be more precise, we prove both that not every Steiner set is a geodetic set and that there are connected graphs whose Steiner number is strictly lower than its geodetic number.