单纯形算法的英文

• simplex algorithm
• simplexalgorithm

• "单纯"英文翻译    simple; pure
• "形"英文翻译    form; shape
• "算法"英文翻译    algorithm
• "对偶单纯形算法" 英文翻译 :    dual simplex algorithm method
• "单纯形" 英文翻译 :    simplex
• "单形算法" 英文翻译 :    simplex algorithm
• "菱形算法" 英文翻译 :    rhombus algorithm
• "梯形算法" 英文翻译 :    trapezoidal algorithm
• "锥形算法" 英文翻译 :    taper algorithm; tapered algorithm; tapering algorithm
• "抽象单纯形" 英文翻译 :    abstract simplex
• "单纯形表" 英文翻译 :    simplex tableau; simply tableau
• "单纯形乘子" 英文翻译 :    simplex multiplier
• "单纯形程序" 英文翻译 :    simplex procedure
• "单纯形迭代" 英文翻译 :    simplex iteration
• "单纯形法" 英文翻译 :    simplex algorithm; simplex method; simplex search method; simplexsearchmethod; simplicial method
• "单纯形方法" 英文翻译 :    simplex algorithm; simplex method
• "单纯形判据" 英文翻译 :    simplex criterion
• "单纯形优化" 英文翻译 :    simplex oqtimization
• "改进单纯形" 英文翻译 :    modified simplex
• "基本单纯形" 英文翻译 :    simple simplex
• "主单纯形法" 英文翻译 :    primal simplex method; primalsimplexmethod
• "单纯形法 单纯形方法 单体法" 英文翻译 :    simplexmethod
• "图形算法语言" 英文翻译 :    graal graph algorithmic language
• "字符图形算法" 英文翻译 :    character graphic algorithm
• "单纯形的维数" 英文翻译 :    dimension of a simplex

• On the simplex algorithm with largest improvement rule
  关于使用最大改进规则的单纯形算法
• Improvement on the dual simplex method about linear programming
  线性规划对偶单纯形算法的改进
• A dynamic simplex routing algorithm of telecommunication network routing scheme
  应用单纯形算法解决动态路由问题
• In this paper we improve the simplex algorithm for quadratic programs , from algorithm to convergence conditions , and get simpler procedure and converging rules
  摘要本文对二次规划的单纯形算法，从算法到收敛条件均加以改进，得到更简易的程序和收敛准则。
• In the dissertation , the simplex method basing on stochastic simulations is first presented , which provides a direct approach for computing stochastic chance constrained line
  本论文首次提出基于随机模拟方法的单纯形算法，为随机机会约束线性规划提供了一种直接计算方法。
• We described the distribution network flow and get an algorithm of minimum cost flow about a special distribution network flow problem by extending the network simplex method
  对分配网络流做了介绍，通过将网络单纯形算法加以推广，得到了一类特殊分配网络流的最小费用流的一种算法。
• The method proposed in this paper is a generalization of basis deficiency - allowing variation of the simplex method to linear programming problems with bound constraints
  为克服单纯形算法中退化现象带来的困扰,本文在文[ 1 ]的基础上进一步提出亏基有界变量单纯形算法,并证明了算法的收敛性
• In this paper a dual simplex method for linear programming with bounded variables was given , which generalizes and extends the classic dual simplex method for a general linear programming
  摘要给出变量有上界的线性规划问题的对偶单纯形算法，该算法包含了一般线性规划问题的对偶单纯形算法，为解变量有上界的线性规划问题提供了又一种方法。
• In the third chapter , we also propose some methods to optimize the parameters of the hybrid genetic algorithm , when used these ways in hybrid genetic algorithm ( ga + simplex ) , the results we got are much better than before
  我们还对混合遗传算法的一些参数进行了改进，并运用于遗传算法+单纯形算法的混合遗传算法中，证明这些改进较以前的方法在稳定性，收敛速度上都有提高。
• The most dangerous sliding surface and the corresponding minimum safety coefficient of slope stability with soil nail structure are searched by empirical genetic - simplex algorithm . the results obtained by empirical genetic - simplex algorithm are compared with the ones obtained by general genetic algorithm
  用经验遗传-单纯形算法寻找了土钉支护结构最危险滑裂面及其对应的最小安全系数fsmin ,从而实现了十分重要但计算量很大、很繁琐的寻优过程。