| 引用本文: | 尚毅,张国光,成孟金.关于大型线性规划问题鞍点算法的讨论.[J].国防科技大学学报,1995,17(1):122-132.[点击复制] |
| Shang Yi,Zhang Guoguang,Cheng Mengjin.A Discussion of the Saddle Point Algorithm for Large Scale LP Problems[J].Journal of National University of Defense Technology,1995,17(1):122-132[点击复制] |
|
| |
|
|
| 本文已被：浏览 5862次 下载 6655次 |
| 关于大型线性规划问题鞍点算法的讨论 |
| 尚毅, 张国光, 成孟金 |
|
(沈阳化工学院 110021)
|
| 摘要: |
| |
| 关键词: |
| DOI： |
| 投稿日期：1994-05-12 |
| 基金项目: |
|
| A Discussion of the Saddle Point Algorithm for Large Scale LP Problems |
| Shang Yi, Zhang Guoguang, Cheng Mengjin |
|
(Shenyang Institute of Chemical Technology)
|
| Abstract: |
| This paper discusses an extremely rapid algorithm for lincar programming whích ís based upon the direct approach to the saddle point of the Lagrangean. The algoríthm appears particularly well suited for problems of high dimensions and with a sígnificant numbers of non zero elements. |
| Keywords: linear programming large scale problems saddle point algorithm |
|
|
|
|
|
