general linear programming problem 一般线性规划问题
The fuzzy linear programming is changed into general linear programming and solved by simplex method.
通过变换，将模糊线性规划问题转化成一般线性规划问题，用单纯形法求解。
This paper presents a simplex method without using the artificial variables. It is suited to solve general linear programming problem.
本文提出一种不用人工变量，适用于求解一般线性规划问题的单纯形法。
After demonstrating the feasibility of using the dual algorithm for general linear programming to solve this model, we get an effective algorithm.
通过论证用一般线性规划的对偶算法求解本模型的可行性，使得该模型的求解问题迎刃而解。
应用推荐