The symmetric difference decomposition method gives an algorithm for the former problem (§4), which is equivalent to the revised simplex algorithm for linear programming.
用对称差分解法自然得到一个算法（§4），相当于改进单纯形算法。
In 1947, George Dantzig developed an efficient method, the simplex algorithm, for solving linear programming problems.
在1947年，George Dantzig开发了一种效率方法——simplex算法——来解决线性编程的问题。
Methods of building linear programming mathematical model for feed compounding and main procedure of realizing improveds simplex algorithm with computer are presented in this paper.
本文首先阐述了如何建立饲料配方的线性规划数学模型，以及用计算机实现改进单纯形算法的主要步骤。
Based on variable substitution and the simplex method for linear programming, the paper also discusses the global optimization algorithm for the absolute value programming.
同时，引入变量代换，基于线性规划的单纯形法，提出该类绝对值规划问题的全局优化求解算法。
Simplex algorithm is an effective method for solving linear programming problem.
单纯形法是求解线性规划问题的有效方法。
The simplex pivotal calculations based on the new criterion can reduce the iterations to the least. The new algorithm can save much CPU time, especially for the large-scale linear programming problem.
按该准则进行的枢轴运算，能使单纯形算法的迭代次数减到最少，尤其对大规划线性规划问题而言，该方法能节省相当可观的CPU计算时间。
The simplex pivotal calculations based on the new criterion can reduce the iterations to the least. The new algorithm can save much CPU time, especially for the large-scale linear programming problem.
按该准则进行的枢轴运算，能使单纯形算法的迭代次数减到最少，尤其对大规划线性规划问题而言，该方法能节省相当可观的CPU计算时间。
应用推荐