【摘要】 单纯形法是求解线性规划问题的常用方法 ,但是 ,在用单纯形法前要求已知一个基本可行解 ,且线性规划需化为典式。虽然有一些方法可得到线性规划的基本可行解 ,但一般要增加人工变量 ,从而增加计算量。针对这一问题 ,文章提出了求非负变量等式约束基本可行解的一种方法。此法不须引入人工变量、不须处理约束方程 ,而直接对等式约束进行初等变换 ,得到一基本可行解 ,并在求解过程中剔除多余的约束 ,判断问题是否有解 ,同时将线性规划的约束方程化为典式。更多还原

【Abstract】 Simplex method is one of the most useful methods to solve linear program. However, before using the simplex method, it is required to have a base feasible solution of linear program and the linear program is changed to the typical form. Although there are some methods to gain the base feasible solution of linear program, artificial variables are added and the times of calculating are increased with these calculations. In this paper, the authors establish a new method of finding the base feasible solution for linear program subject to non-negative variables and equality constraints. It does not require inputting artificial variables or dealing with the restriction equations. In the solving process, the useless restriction equations are found, whether having solution is determined, and the typical form of linear program is achieved.更多还原