| MOORE-PENROSE INVERSE SIMPLEX ALGORITHMS BASED ON SUCCESSIVE LINEAR SUBPROGRAMMING APPROACH |
| |
| 引用本文： | 潘平奇,欧阳梓祥. MOORE-PENROSE INVERSE SIMPLEX ALGORITHMS BASED ON SUCCESSIVE LINEAR SUBPROGRAMMING APPROACH[J]. 高等学校计算数学学报(英文版), 1994, 0(2) |
| |
| 作者姓名： | 潘平奇 欧阳梓祥 |
| |
| 作者单位： | Department of Mathematics & Mechanics，Southeast University，Nanjing 210096，PRC.，Department of Mathematics，Nanjing University，Nanjing 210093，PRC. |
| |
| 基金项目： | The research was supported by the Natural Scinece Foundation of China |
| |
| 摘 要： | Generalized simplex variants based on successive linear subprogramming approach (SLS) are described in this paper. In stead of inverse matrix, these variants employ Moore-Penrose inverse. They are respectively characterized by different pivoting rules, Numerical results of limited tests show encouraging performance of these variants.
|
MOORE-PENROSE INVERSE SIMPLEX ALGORITHMS BASED ON SUCCESSIVE LINEAR SUBPROGRAMMING APPROACH |
| |
| Pan Ping-qi. MOORE-PENROSE INVERSE SIMPLEX ALGORITHMS BASED ON SUCCESSIVE LINEAR SUBPROGRAMMING APPROACH[J]. Numerical Mathematics A Journal of Chinese Universities English Series, 1994, 0(2) |
| |
| Authors: | Pan Ping-qi |
| |
| Affiliation: | Pan Ping-qi Department of Mathematics & Mechanics,Southeast University,Nanjing 210096,PRC.Ouyang Zi-xiang Department of Mathematics,Nanjing University,Nanjing 210093,PRC. |
| |
| Abstract: | Generalized simplex variants based on successive linear subprogramming approach (SLS) are described in this paper. In stead of inverse matrix, these variants employ Moore-Penrose inverse. They are respectively characterized by different pivoting rules, Numerical results of limited tests show encouraging performance of these variants. |
| |
| Keywords: | linear programming successive linear subprogramming simplex variant. |
| 本文献已被 CNKI 等数据库收录！ |
