| 循环线性规划示例的求解 |
| |
| 引用本文： | 徐幼成. 循环线性规划示例的求解[J]. 上海电力学院学报, 2000, 16(1): 43-49 |
| |
| 作者姓名： | 徐幼成 |
| |
| 作者单位： | 上海电力学院基础部 |
| |
| 摘 要： | 利用对偶规划求解一个单纯形法循环的例子，由此减少了单纯形法迭代次数，达到简化计算，加快计算速度，节省存储空间的效果。
|
| 关 键 词： | 线性规划 对偶规划 示例 解 单纯形法 |
An Example of Solving Recurrent Linear Program with Dual Programming |
| |
| Xu Youcheng. An Example of Solving Recurrent Linear Program with Dual Programming[J]. Journal of Shanghai University of Electric Power, 2000, 16(1): 43-49 |
| |
| Authors: | Xu Youcheng |
| |
| Affiliation: | Department of Basic Science |
| |
| Abstract: | This paper tries to find the solution of a simplex-method recurrence by means of dual program, which can reduce the repetitions of simplex-method and simplify the calculations as well. |
| |
| Keywords: | linear program recurrence dual program |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《上海电力学院学报》浏览原始摘要信息 |
|
点击此处可从《上海电力学院学报》下载全文 |
