| 寻求线性规划问题初始基可行解的一种新算法 |
| |
| 引用本文： | 许如初,宋恩民,陈卫东.寻求线性规划问题初始基可行解的一种新算法[J].华中科技大学学报(自然科学版),1997(1). |
| |
| 作者姓名： | 许如初 宋恩民 陈卫东 |
| |
| 作者单位： | 华中理工大学计算机科学与工程系 |
| |
| 摘 要： | 对线性规划问题基可行解的性质进行了研究，给出了一种求解线性规划问题初始基可行解的算法，该算法的时间复杂度是约束条件个数的线性函数
|
| 关 键 词： | 线性规划 可行域 基可行解 约束条件 |
A New Algorithm for the Initial Basic Feasible Solution of a Linear Programming Problem |
| |
| Xu Ruchu Lect., Dept. of Computer Sci. & Eng.,HUST,Wuhan ,China. Song Enmin Chen Weidong.A New Algorithm for the Initial Basic Feasible Solution of a Linear Programming Problem[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,1997(1). |
| |
| Authors: | Xu Ruchu Lect Dept of Computer Sci & Eng HUST Wuhan China Song Enmin Chen Weidong |
| |
| Institution: | Xu Ruchu Lect., Dept. of Computer Sci. & Eng.,HUST,Wuhan 430074,China. Song Enmin Chen Weidong |
| |
| Abstract: | 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. |
| |
| Keywords: | linear programming problem feasible region basic feasible solution constraint condition |
| 本文献已被 CNKI 等数据库收录！ |
