Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (30): 94-96.

• 学术探讨 • Previous Articles     Next Articles

Direct way of simplex method for solving linear programming model

SHEN Mao-xing1,2,XU Jin1   

  1. 1.Department of Control Science and Engineering,Huazhong University of Science and Technology,Wuhan 430074,China
    2.Missile Institute,Air Force Engineering University,Sanyuan,Shaanxi 713800,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-10-21 Published:2007-10-21
  • Contact: SHEN Mao-xing

求解线性规划的单纯形法的直接方法

申卯兴1,2,许 进1   

  1. 1.华中科技大学 控制科学与工程系,武汉 430074
    2.空军工程大学 导弹学院,陕西 三原 713800
  • 通讯作者: 申卯兴

Abstract: An association between the elementary transformation of matrix and the concept of initial feasible basis is established,and then,a determination way for initial feasible basis of linear programming is presented.A direct way of the simplex method for solving a linear programming problem is presented,this scheme is concisely,convenience and making the solving procedure clearly in practice.Some examples are given to demonstrate these good characteristics.

摘要: 通过对单纯形求解法的实质的分析和认识,提出了基于矩阵初等变换初始可行基的获得方法,进而得到基于单纯形法的求解线性规划模型的直接方法,省略了以往为选择解法而进行的分析判断,使单纯形法的运用简便明了。