| 二维线性规划问题的非数值算法 |
| |
| 引用本文： | 周培德.二维线性规划问题的非数值算法[J].北京理工大学学报,1996,16(6):665-670. |
| |
| 作者姓名： | 周培德 |
| |
| 作者单位： | 北京理工大学计算机科学与工程系 |
| |
| 摘 要： | 提出了一种求解二维线性规划问题的非数值算法，其基本思想是采用分治法，依据直线的斜度及在ｘ和ｙ轴上截距将约束条件分成不同的类，删去多余的约束条件，从而达到简化计算的目的。
|
| 关 键 词： | 线性规划 非数值算法 分治法 复杂性 |
An Non-Numerical Algorithm in Two-Dimensional Linear Programming |
| |
| Zhou Peide.An Non-Numerical Algorithm in Two-Dimensional Linear Programming[J].Journal of Beijing Institute of Technology(Natural Science Edition),1996,16(6):665-670. |
| |
| Authors: | Zhou Peide |
| |
| Abstract: | Presents on non-numerical algorithm for solving 2-dimensional linear programming problems with its basic idea in divide-and-conquer. It can divide the astriction condition into different dasses according to the straight slope and the truncated distance on the x and y-axis, and then remove the redundant redundant restrictive conditions such that the computation is much simplified . This algorithm requiresO(n2) comparisons and O(n2) arithmetic operations. |
| |
| Keywords: | linear program non-numerical algorithm divide-and-conquer complexity of algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
| 点击此处可从《北京理工大学学报》下载免费的PDF全文 |
