不等式组

In the third chapter, we discuss an integral inequalities system with retard and unknown functions of power.

在本文第三章中，我们研究了一个带有时滞的、未知函数项带有方幂的积分不等式组。

The domain decomposition method of Jacobi type for the quasivariational inequality system is proposed and the corresponding monotone convergence theory is established.

然后提出了上述拟变分不等式组的Jacobi型区域分解法，并建立相应的收敛性理论。

We introduce the iterative method of Jacobi type to solve the discrete problem of the quasivariational inequality system. A new proof for the monotone convergence of the iterative method is given under appropriate conditions.

我们首先介绍求解Hamilton-Jacobi-Bellman方程的近似拟变分不等式组离散问题的一类Jacobi型迭代算法，在一定假设条件下，对这类算法的单调收敛性给出了一个新的证明。

In the field of energy planning, we are always required to solve a kind of linear-inequalities problems with large-scale and sparse coefficient matrix.

自二十世纪五十年代的运筹学以及管理科学的兴起和发展以来，解决线性不等式组的方法层出不穷。

Linear system of inequalities is widely used in many fields; it is usually solved as a linear programming problem by simplex method and interior-point method.

线性不等式组应用广泛，一般可以看作线性规划问题用单纯形法或者内点法来求解。

The result shows that the transformation from linear system of strict inequalities to minimax problem avoids the shortage of getting a boundary point solution and is satisfying.

最后在Matlab环境下给出了数值实验，实验结果表明，将严格线性不等式组问题转化为Minimax问题来求解，避免了得到边界点解的情形，得到的结果比较令人满意

Besides, motivated by a practical problem from molecular biology we encountered, we have studied the complicated system of inequalities with possible inconsistency involving multilevel "and","or" relationships.

此外，受分子生物学中一个实际问题的促动，我们还研究了包含多层"and"、"or"关系的可能不相容复杂不等式组问题。

However, various algorithms of MFD have a common shortcoming, that is, the initial iteration point must be feasible, so an auxiliary procedure must be considered for finding an initial feasible point, i.e., a system of nonlinear inequalities must be solved before using the method of feasible directions, which is not easy to be finished in generally, especially for large scale problems.

然而，各类可行方向算法有一共同的缺点，那就是初始迭代点必须可行，从而需要一个辅助程序来寻找一个初始可行点，即在运用可行方向法之前先要求解一非线性不等式组，而这个问题通常不易解决，特别是对于大规模问题而言。

By applying existence theorems of maximal elements for a family of GB-majorized mappings in a product space of G-convex spaces, some coincidence theorem, Fan-Browder type fixed point theorem and some existence theorems of solutions for a system of minimax inequalities are proved under noncompact setting of G-convex spaces.

通过应用G-凸空间的乘积空间内一族GB-优化映象的极大元的存在定理，在G-凸空间的非紧设置下证明了某些重合点定理，Fan-Browder型不动点定理和极小极大不等式组的解的存在性定理。

By introducing a smooth merit function for linear inequalities system problem, the problem was equivalently reformulated as an unconstraint optimization problem.

通过引入线性不等式组问题的一类光滑价值函数，将其求解问题等价地转化为无约束优化问题的求解。

Lugalbanda was a god and shepherd king of Uruk where he was worshipped for over a thousand years.

Lugalbanda 是神和被崇拜了一千年多 Uruk古埃及喜克索王朝国王。

I am coming just now,' and went on perfuming himself with Hunut, then he came and sat.

我来只是现在，'歼灭战perfuming自己与胡努特，那麼，他来到和SAT 。