解集

These weight matrices are actually the least solution matrix and all maximal solution matrices of the min-implication fuzzy relation equation, respectively. The complete solution set of min-implication fuzzy relation equation can be determined by the maximal solution set of this equation.

同时给出了严格的定理证明：这些连接权矩阵分别为对应的最小-蕴涵合成模糊关系方程的最小解和所有极大解，从而得到了此模糊关系方程的完备解集。

Experimental results and theoretical analysis show it can accurately evaluate the solution set of distribution.

理论分析与实验结果证明该方法能精确地评价解集的分布情况。

And based on this result, we also prove the connectedness of G-properly efficient solution set when the vector objected function is both like-convex and quasi-convex.

在此基础上，还得到向量目标函数既似凸又拟凸的多目标最优化问题G-恰当有效解集是连通的结论。

At last, we provide the upper semi-continuity and compactness of the spectral scalar solution set mapping under some suitable conditions, and the necessary and sufficient conditions to guarantee the lower semi-continuity of the spectral scalar solution set mapping by virtue of the concept of essential solution.

最后，给出了谱标量解集映射满足上半连续且紧的充分条件及下半连续的充分必要条件。

The method attempts to transform the original problem into a series of unconstraint optimization problems.

在这些研究中，均假定在对数障碍函数是严格凸的及解集是非空有界的情况下，证明了方法的全局收敛性。

By using the uniform convergence and invexity the continuity of the approximating set of Pareto solutions of the problem is obtained.

在一致收敛性和不变凸性的条件下得到了近似有效解集的连续性。

Scrolls profile optimization; Whewell equation; Nondominated Sorting Genetic Algorithm; Pareto optimal sets

涡旋型线；形状优化；Whewell方程；非劣优选遗传算法；Pareto最优解集

It is most important for the high fault-tolerance performance, rapidity, accuracy of FSD and for the high efficiency, categoricalness of decision-making solution set to FSR and for the basis of realized algorithm.

它是确保高容错性、快速、准确故障定位和隔离及高效、完备的故障恢复决策解集构造实现算法的最重要的基础性问题。

In Chapter 2, we consider the error bound and the auxiliary problem algorithm for the generalized linear complementarity problem over a polyhedral cone: First, we give an absolute and a relative global error bound for GLCP and nondegenerate GLCP, respectively, and then we explore the properties of the solution set of the problem, based on which we establish another absolute and relative error bound for GLCP which is much exacter compared with the result above.

第二章主要研究了闭凸锥上广义线性互补问题的误差界及基于其上的一个求解GLCP的辅助问题算法：(1)给出了GLCP的全局绝对误差界和在有非退化解时的全局绝对误差界及其相对误差界；(2)对GLCP的解集结构进行了探讨，并利用得到的结果给出了GLCP的另一个全局绝对误差界和相对误差界估计；(3)我们提出了一个求解GLCP的辅助问题算法，并证明在适当条件下该算法具有全局收敛性。

This paper discussed almost everywhere upper semiconvergence of optimal solution set of empirical approximations for stochastic programs.

本文对随机规划经验逼近最优解集的几乎处处上半收敛性进行了研究。

As she looked at Warrington's manly face, and dark, melancholy eyes, she had settled in her mind that he must have been the victim of an unhappy attachment.

每逢看到沃林顿那刚毅的脸，那乌黑、忧郁的眼睛，她便会相信，他一定作过不幸的爱情的受害者。

Maybe they'll disappear into a pothole.

也许他们将在壶穴里消失