• 对偶单纯形法线性规划问题时,必须找到初始正则

    To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.

    youdao

  • 原始单纯两阶段单纯形法对偶单纯形法具有更大优越性

    It has more advantages than primal simplex algorithm, two-stage simplex algorithm and dual simplex algorithm.

    youdao

  • 线性规划问题除常见单纯对偶单纯形法外,还有一种原始对偶

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

    youdao

  • 稀疏对偶单纯求解时段经济功率分配,所用内存计算时间

    Small memory capacity and short CPU time are repuired by the algorithm for the solution of the economic dispatch every interval with simple form of sparse dual method.

    youdao

  • 利用对偶规划求解一个单纯形法循环例子,由此减少单纯形法迭代次数,达到简化计算、加快计算速度、节省存储空间的效果

    This paper tries to find the solution of a simplex-method recurrence by means of dual program, which can reduce the repetitions of simplex-method and simplify the calculations as well.

    youdao

  • 本文主要讨论了生产网络最小费用问题研究问题基本结构及其对偶性质的基础上给出问题的网络单纯

    The infrastructure and dual properties of the so-called minimum cost problem are specifically studied to outline a network simplex method for solving this problem.

    youdao

  • 本文主要讨论了生产网络最小费用问题研究问题基本结构及其对偶性质的基础上给出问题的网络单纯

    The infrastructure and dual properties of the so-called minimum cost problem are specifically studied to outline a network simplex method for solving this problem.

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定