环的素谱的若干注记

对于可换环Ｒ,本通过考察ＳｐｅｃＲ和Ｈ０Ｒ,得到了关于广义素环和广义半素环的一些结果,另一方面,本还得到了有关连通性与道路连通性的几个结果。     

多目标最优化G-恰当有效解集的存在性和连通性

本文证明了非空紧凸集上拟凸多目标最优化问题的G-恰当有效解的存在性．在此基础上，得到了向量目标函数既是似凸又是拟凸的多目标最优化问题的G-恰当有效解集是连通的结论．同时，还给出一个关于Pareto有效解集连通性的新结果．     

Connectedness of the set of nondominated outcomes in multicriteria optimization

Sufficient conditions for the set of nondominated outcomes of a multicriteria optimization problem to be connected are given.The author would like to thank Professors G. Leitmann and P. L. Yu for many critical remarks.The contents of this article are taken from the author's doctoral dissertation written at the University of California at Berkeley under the supervision of Professor G. Leitmann.     

Connectedness with Respect to a Closure Operator

A notion of connectedness with respect to a closure operator C and a class of monomorphisms N is introduced in an arbitrary category X. It is shown that under appropriate hypotheses, most classical results about topological connectedness can be generalized to this setting. Examples that illustrate this new concept are provided.     

超空间2^X的连通性及其相关性质

研究了赋予Vietoris拓扑的超空间2X的连通性及其相关性质.这改进了Micheal[1]的一个定理的结论.     

格的内蕴拓扑与完全分配律

本文以Ｓｃｏｔｔ拓扑，Ｚａｒｉｓｋｉ拓扑，区间拓朴等刻划了完全分配律；获得了格的特殊元的存在性与区间拓扑连通性等之间的众多制约关系，给出了若干应用实例和重要反例．     

Connectedness of super efficient solution sets for set-valued maps in Banach spaces

In this paper, we study the connectedness of the super efficient solution sets in convex vector optimization for set-valued maps in Banach spaces.     

Connectedness of the Efficient Set for Three-Objective Quasiconcave Maximization Problems

For three-objective maximization problems involving continuous, semistrictly quasiconcave functions over a compact convex set, it is shown that the set of efficient solutions is connected. With that, an open problem stated by Choo, Schaible, and Chew in 1985 is solved.     

Bicriteria linear fractional programming

As a step toward the investigation of the multicriteria linear fractional program, this paper provides a thorough analysis of the bicriteria case. It is shown that the set of efficient points is a finite union of linearly constrained sets and the efficient frontier is the image of a finite number of connected line segments of efficient points. A simple algorithm using only one-dimensional parametric linear programming techniques is developed to evaluate the efficient frontier.This research was partially supported by NRC Research Grant No. A4743. The authors wish to thank two anonymous referees for their helpful comments on an earlier draft of this paper.     

集值映射最优化问题超有效解集的连通性

本文在局部凸空间中对集值映射最优化问题引入超有效解的概念．首先研究了超 有效点的一些重要特性．其后证明了当目标函数为锥类凸的集值映射时，其目标空间里 的超有效点集是连通的；若目标函数为锥凸的集值映射时，其超有效解集也是连通的．