| 用人造基求最优解的简化算法 |
| |
| 引用本文： | 王强,金淑华.用人造基求最优解的简化算法[J].长春师范学院学报,2006(6). |
| |
| 作者姓名： | 王强 金淑华 |
| |
| 作者单位： | 长春税务学院 吉林长春130117 |
| |
| 摘 要： | 线性规划中,若有解讨论其最优解,换基迭代是核心,为了避免利用辅助函数找可行基的过程冗长、繁琐,本文给出较为简单的用初等变换方法求可行基的方法。
|
| 关 键 词： | 线性规划 最优解 换基迭代 辅助函数 初等变换 |
The Simply Calculated Way to Solve the Superior Solution with Artificial Foundation |
| |
| WANG Qiang,JIN Shu-hua.The Simply Calculated Way to Solve the Superior Solution with Artificial Foundation[J].Journal of Changchun Teachers College,2006(6). |
| |
| Authors: | WANG Qiang JIN Shu-hua |
| |
| Abstract: | In the line programming,discussing the superior solution if it has solutions,and change base for replace is the cove.For avoiding the tedious process of using assistant function to search useful foundations,this text lists the easier way to solve useful foundations with elementary change. |
| |
| Keywords: | line programming superior solution change base for replace assistant function elementary change |
| 本文献已被 CNKI 等数据库收录！ |
|
