区间值模糊集之间一种新距离的完备性

定义区间值模糊集之间的一种新距离d*∞,讨论了这种距离的基本性质,并证明区间值模糊数的距离空间(IΦ*(R),d*∞)是完备的,但它却是不可分的。     

基于自反关系的区间值模糊近似空间诱导的拓扑结构

给出了论域U上自反的区间值模糊关系R诱导拓扑的一种新方法,并与胡凯的关于模糊紧性与粗集拓扑的研究中R诱导拓扑的方式进行了比较。结果表明:(1)后者需要R具有传递性才能生成拓扑,而前者则不需要此条件;(2)当R满足传递性时,两种方式生成的拓扑是相同的。     

基于多目标规划法的模糊线性回归分析

讨论输入、输出均为模糊数,回归系数为实数时的模糊线性回归分析。由于模糊最小二乘线性回归容易受异常值的影响,而最小一乘法能有效地降低回归模型的误差。为此,基于最小一乘法,建立多目标规划模型并将其转化为非线性规划问题进行求解,从而实现模糊线性回归模型的参数估计。最后,结合一个数值实例,验证和比较该方法的合理性和优越性。     

半连续格的半素极小集与序同态扩张

对完备格引入半素极小集的概念,证明完备格L为半连续格当且仅当L中的每个元在L中存在半素极小集,给出半连续格的两个序同态扩张定理.     

知识的Fuzzy-Rough性研究及其应用

提出了知识的Rough熵与Fuzzy熵的概念,综合度量了知识的粗糙性和二元关系的不确定性,讨论了它的性质,给出了若干定理,并应用于目标信息系统的相对约简,得到最小约简,最后举例说明相对约简过程。     

L-预拓扑空间中的近似L-开集及相关的连通性和范畴性质

研究L-预拓扑空间中L-开集的一些近似形式(其中L是有逆合对应的C-格):θ-L-开集,δ-L-开集,α-L-开集以及β-L-开集。证明了(1)当L的最大元1是并既约元时L-预拓扑空间的连通性、θ-连通性、δ-连通性和α-连通性是等价的;(2)θLTop是LTopsθ、LTop以及LTopθ的反射满子范畴,δLTop是LTopsδ和LTopδ的反射满子范畴;(3)当格L为幂集格时αLTop是LTopsα和LTopα的余反射满子范畴;θLPTop是LPTopsθ、LPTop以及LPTopθ的反射满子范畴,δLPTop是LPTopsδ和LPTopδ的反射满子范畴。     

The almost chebyshev property in linear semi-infinite programming

We consider a linear semi-infinite programming problem where the index set of the constraints is compact and the constraint functions are continuous on it. The set of all continuous functions on this index set as right hand sides are the parameter set. We investigate how large various unicity sets are.We state a condition on the objective function vector and the “matrix” of the problem which characterizes when the set of a parameters with a non-unique optimal point is a set of the first Baire category in the solvability set. This is the case if and only if the unicity set is a dense subset of the solvability set. Under the same assumptions it is even true that the interior of the strong unicity set is I also dense. If the index set of the constraints contains a dense subset with the property that each point1 is a G ₈-set, then the parameters of the strong unicity set, such that the optimal point satisfies the linear independence constraint qualification, are also dense.

We apply our results to a characterization of a unique continuous selection for the optimal set I mapping and to a one-sided L ₁-approximation problem     

Biobjective center – balance graph location model *

In the paper, a new algorithm for finding the absolute center of the graph is proposed. Later on problem of the absolute balance point of the graph is investigated the objective function of which is defined as the difference in the distance from the located facility to the farthest and the nearest demand point. An algorithm for finding it is presented By following the balance criterion it may happen, that the balance point is located too far from the demand points. Conversely, if we are interested not only in the distance to the farthest demand point, but (what is more realistic) also in the structure of the distances, a criterion of balance is appropriate. Consequently, we investigate the center balance constrained model that simultaneously used center and balance criteria. By considering the center and the balance objective in a multiobjective framework, efficient solutions are generated by minimizing former objective such that latter satisfies an upperbound     

Generalized quasi variational inequalities and implicit wiener – hopf equations *

In this paper, we introduce and study some new classes of variational inequalities and the Wiener – Hopf Equations. These classes are more general and unifying ones. Using essentially the projection technique, we establish equivalence between these new classes. This equivalence is used to suggest and analyze some new iterative algorithms for solving the generalized quasi variational inequalities. We also study the convergence analysis for these iterative algorithms. Some special cases are also discussed