| 线性规划内点法中判别最优基的准则 |
| |
| 引用本文： | 魏紫銮. 线性规划内点法中判别最优基的准则[J]. 计算数学, 1996, 18(2): 215-224 |
| |
| 作者姓名： | 魏紫銮 |
| |
| 作者单位： | 中国科学院计算数学与科学工程计算研究所 |
| |
| 摘 要： | 线性规划内点法中判别最优基的准则魏紫銮（中国科学院计算数学与科学工程计算研究所）ＡＮＯＰＴＩＭＡＬＢＡＳＩＳＩＤＥＮＴＩＦＩＣＡＴＩＯＮＣＲＩＴＥＲＩＯＮＦＯＲＩＮＴＥＲＩＯＲＰＯＩＮＴＬＩＮＥＡＲＰＲＯＧＲＡＭＭＩＮＧＡＬＧＯＲＩＴＨＭＳ￥ＷｅｉＺ...
|
| 关 键 词： | 线性规划 内点法 最优基 最优解 |
AN OPTIMAL BASIS IDENTIFICATION CRITERION FOR INTERIOR POINT LINEAR PROGRAMMING ALGORITHMS |
| |
| Affiliation: | Wei Zi-luan (Institute of Computational Mathematics and Scientific/Engineering Computing, Academia Sinica) |
| |
| Abstract: | AbstractIn this paper the properties of an indicator vector for idetifying an optimal basis of linear programming problem are analyzed in the interior-point algorithms, and under suitable assumptions an optimal basis identification criterion is presented during the iterative process. |
| |
| Keywords: | |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《计算数学》浏览原始摘要信息 |
|
点击此处可从《计算数学》下载全文 |
