This paper presents a simplex method without using the artificial variables. It is suited to solve general linear programming problem.
本文提出一种不用人工变量，适用于求解一般线性规划问题的单纯形法。
This is essentially a linear programming problem. This case is more special than the general problem, since
这实际上是一个线性编程问题。
In this paper, the authors present an algorithm to handle linear fractional programming in the general form directly, which need not transform the constraints of the problem into the standard form.
本文提出一个直接处理一般形式线性分式规划的算法而不需要把问题的约束条件转化为标准形式。
To improve the method of solving linear programming problem by means of simplex method, this paper gives the method of linear programming problem general solution with infinite optimal solutions.
为了进一步完善解线性规划问题的单纯形法，本文给出了表达一类具有无穷多个最优解的线性规划问题通解的方法。
To improve the method of solving linear programming problem by means of simplex method, this paper gives the method of linear programming problem general solution with infinite optimal solutions.
为了进一步完善解线性规划问题的单纯形法，本文给出了表达一类具有无穷多个最优解的线性规划问题通解的方法。
应用推荐