|
|||||
|
|
| NEW ALGORITHMS FOR LINEAR PROGRAMMING | |
| 作者姓名： | 吴士泉 吴方 |
| 作者单位： | Institute of Applied Mathematics，Academia Sinica，Beijing 100080，China，Institute of Applied Mathematics，Academia Sinica，Beijing 100080，China |
| 摘 要： | The problem of solving a linear programming is converted into that of solving an uncon-strained maximization problem in which the objective function is concave. Two algorithms areproposed. These two algorithms have very simple structure and can be implemented easily. Forany given precision, the algorithms will terminate in a finite number of steps. |
| 本文献已被 CNKI 等数据库收录！ | |