广义向量均衡问题的解与解集的凸性

引进集值映射的锥真拟凹概念，讨论一类具有集值映射的广义向量衡问题解的存在性与解集的凸性。     

向量优化问题广义有效点的一个存在性定理

利用集值映射不动点定理及最优化问题与变分不等式的关系给出线性G^↑ateaux可微的锥凸映射的广义有效点的一个存在性定理。     

Rough隶属函数关于集合并与交的一种高精度计算方法

近些年来，许多处理近似问题的方法陆续被提出，其中利用Rough集理论计算两个集合的并和交的Rough隶属函数方法是被用较多的一种方法，但毕竟该方法精度较差。为此，介绍了一种精度较高的计算两个集合的并和交的Rough隶属函数方法，它克服了前者利用Rough集理论计算Rough隶属函数的复杂性，而迎来了简单和高精度的特点。     

A strong law of large numbers for generalized random sets from the viewpoint of empirical processes

In this article we prove a strong law of large numbers for Borel measurable nonseparably valued random elements in the case of generalized random sets.

     

Difference Sets and Recursion Theory

There is a recursive set of natural numbers which is the difference set of some recursively enumerable set but which is not the difference set of any recursive set.     

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS）

Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O（n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented.     

集合环

本文用集环来表现模糊集，得到了表现定理的新形式，并证明了这种表现可以有限化，即用有限个经典集近似刻划模糊集并且这样的刻划是同态的。最后，证明了集对方法是集环表现的特殊情形。     

CONE-DIRECTED CONTINGENT DERIVATIVES AND GENERALIZED PREINVEX SET-VALUED OPTIMIZATION

By using cone-directed contingent derivatives, the unified necessary and suffi-cient optimality conditions are given for weakly and strongly minimal elements respectively in generalized preinvex set valued optimization.     

Partition Lattice q-Analogs Related to q-Stirling Numbers

We construct a family of partially ordered sets (posets) that are q-analogs of the set partition lattice. They are different from the q-analogs proposed by Dowling [5]. One of the important features of these posets is that their Whitney numbers of the first and second kind are just the q-Stirling numbers of the first and second kind, respectively. One member of this family [4] can be constructed using an interpretation of Milne [9] for S[n, k] as sequences of lines in a vector space over the Galois field F _q. Another member is constructed so as to mirror the partial order in the subspace lattice.