对偶单纯形法 dual simplex method
- 在用对偶单纯形法解线性规划问题时,必须找到初始正则解。
To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution. - 它比原始单纯形法、两阶段单纯形法、对偶单纯形法具有更大的优越性。
It has more advantages than primal simplex algorithm, two-stage simplex algorithm and dual simplex algorithm. - 解线性规划问题除常见的单纯形法和对偶单纯形法外,还有一种原始对偶法。
Commonly in additional to simplex method and dual simplex method, another original dual method can solve the liner programming.
您正在访问的是
中国词汇量第二的英语词典
更多精彩,登录后发现......