论文部分内容阅读
本文针对一类具有广泛实际背景的线性规划问题，探求一种迅速、简便的直接解法．该算法仅需几步就可达到最优解．
In this paper, a fast and easy direct solution to a class of linear programming problems with a wide range of practical backgrounds is explored. The algorithm achieves the optimal solution in just a few steps.