英汉例句

• This paper presents a simplex method without using the artificial variables. It is suited to solve general linear programming problem.

  本文提出一种不用人工变量，适用于求解一般线性规划问题的单纯形法。

• Multiple optimal solutions to the linear programming problem by the simplex method for specific feasible regions sometimes might lead to a loss of efficiency.

  用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。

• Based on variable substitution and the simplex method for linear programming, the paper also discusses the global optimization algorithm for the absolute value programming.

  同时，引入变量代换，基于线性规划的单纯形法，提出该类绝对值规划问题的全局优化求解算法。

• One problem caused by using simplex method is that the results are fractional values while need integers, and that provides a simple but effective method to solve it.

  运用单纯形方法的一个问题是解为小数值，作者用一个简单的方法进行取整。

• But it has been proved that the simplex method is exponential computational complexity in theory.

  但在理论上，单纯形法被证明是指数复杂性的。

• PLS partitions the population into a group of disjoint subpopulations by cluster analysis, then USES simplex method to search local optima in each subpopulation in parallel.

  PLS算子通过聚类分析将种群分割为互不相交的邻域子种群，对每一个子种群应用单纯形法进行并行局部搜索。

• Commonly in additional to simplex method and dual simplex method, another original dual method can solve the liner programming.

  解线性规划问题除常见的单纯形法和对偶单纯形法外，还有一种原始对偶法。

• Tacticians on the simplex method source code, the use of this method is a two-stage method.

  这是关于运筹学上的单纯形法的源码，此方法用的是两阶段法。

• By use of the simplex method of the goal programming, we obtains the calculation formula and some properties of the generalized solution of fuzzy equation.

  运用目的规划的单纯型方法，得到了模糊方程广义解的计算公式及模糊方程广义解的若干性质。

• Based on the convex simplex method for nonlinear programming, a sensitivity analysis of consumption coefficient matrix in linear fractional programming is presented.

  基于解非线形规划的凸单纯形法，对一类线形分式规划的消耗系数矩阵进行灵敏度分析。

• By using simplex method to solve the LP, the optimal solution of ILP can be obtained.

  利用单纯形法求解该线性规划问题，便可得到整数规划的最优解。

• The revised simplex method is used at first to calculate the optimal line extensions without integer constraints of the variables so that it can be determined which lines should be constructed.

  第一步不考虑变量的整数约束，用修正单纯形法求解，由此可确定一部分线路是否需要建设。

• This paper presents an improved (infeasible) simplex method for linear programming, in which some of vertex points, corresponding to the iterative process, can be out of the feasible domain of (LP).

  提出了一种求解线性规划(LP)的改进的单纯形法，其迭代过程产生的一部分极点可能出现在可行域外成为不可行极点，因此称之为外点单纯形法。

• An improved simplex method (ISM) based on Nelder and Meads simplex method (N-M SM) is presented for unconstrained function optimization.

  针对无约束函数最优化问题，提出了一种能有效加快收敛速度的改进单纯形算法。

• This algorithm is a simplex method based on the simple object and multi_condition restriction.

  该算法是基于单目标、多约束条件的单纯形法。