| 判断具有多线性约束条件的凸空间是否为空的交边算法 |
| |
| 引用本文： | 宋恩民 黄文奇. 判断具有多线性约束条件的凸空间是否为空的交边算法[J]. 计算机学报, 1996, 19(9): 704-708 |
| |
| 作者姓名： | 宋恩民 黄文奇 |
| |
| 作者单位： | 华中理工大学计算机科学与工程系 |
| |
| 摘 要： | 本文研究被若干线性约束条件界定的凸空间是否为空的判断问题，此问题在线性规划中有广泛的实际背景。本文提出了一个求解此问题的交边算法，该算法已被编程实现了，实际试算表明，其平均计算时间复杂度不高，是目前求解同类问题的算法中的较优者。
|
| 关 键 词： | 线性约束 凸空间 交边算法 线性规划 |
AN INTERSECTING-SIDE ALGORITHM TO DETERMINE WHETHER CONVEX REGIONS BOUNDED BY MULTIPLE CONSTRAINTS ARE EMPTY |
| |
| Song Enmin and Huang Wenqi. AN INTERSECTING-SIDE ALGORITHM TO DETERMINE WHETHER CONVEX REGIONS BOUNDED BY MULTIPLE CONSTRAINTS ARE EMPTY[J]. Chinese Journal of Computers, 1996, 19(9): 704-708 |
| |
| Authors: | Song Enmin and Huang Wenqi |
| |
| Abstract: | The problem of determining whether convex regions bounded by multiple constraints are empty, which has a wide practical background in linear programming, is studied in this paper. An intersecting-side algorithm to solve this problem is presented. The algorithm has been implemented, and it is shown by practical computing that its complexity of average computation time is not high. |
| |
| Keywords: | Linear constraining convex regions intersecting-side algorithm corner point linear programming |
| 本文献已被 CNKI 维普 等数据库收录！ |
