A New Method for Achieving an Initial Regular Solution of a Linear Programming  

作　　者：梁平 孙艳华 魏德宾 张相斌 

机构地区：[1]College of Information, Dalian University, Dalian, 116622 [2]College of Ecnomics and Management, Dalian University, Dalian, 116622

出　　处：《Northeastern Mathematical Journal》2008年第1期31-34,共4页东北数学（英文版）

基　　金：The NSF(70572069)of China.

摘　　要：A method is provided for finding an initial regular solution of a linear programming in this paper. The key to this method is to solve an auxiliary linear programming instead of to introduce any artificial variable or constraint. Compared with the traditional method of achieving the regular solution by introducing an artificial constraint, it has advantages of saving the memories and little computational efforts.A method is provided for finding an initial regular solution of a linear programming in this paper. The key to this method is to solve an auxiliary linear programming instead of to introduce any artificial variable or constraint. Compared with the traditional method of achieving the regular solution by introducing an artificial constraint, it has advantages of saving the memories and little computational efforts.

关 键 词：initial regular solution auxiliary linear programming artificial variable artificial constrain 

分 类 号：O221.1[理学—运筹学与控制论]