寻求线性规划问题初始基可行解的一种新算法  

A New Algorithm for the Initial Basic Feasible Solution of a Linear Programming Problem

作　　者：许如初[1] 宋恩民[1] 陈卫东[1] 

机构地区：[1]华中理工大学计算机科学与工程系

出　　处：《华中理工大学学报》1997年第1期105-107,共3页Journal of Huazhong University of Science and Technology

摘　　要：对线性规划问题基可行解的性质进行了研究，给出了一种求解线性规划问题初始基可行解的算法。The properties of the basic feasible solution of a linear programming problem are studied. An algorithm for finding the initial basic feasible solution for a linear programming problem is given. The basic idea is discussed and the procedure described. The results show that the complexity of the computing time of the algorithm is a linear function of the number of constraint conditions.

关 键 词：线性规划 可行域 基可行解 约束条件 

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