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 charact...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.展开更多
基金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.
