haku: @indexterm ALGORITHMS / yhteensä: 403
viite: 105 / 403
| Tekijä: | Kaliski, J. Ye, Y. |
| Otsikko: | A short-cut potential reduction algorithm for linear programming |
| Lehti: | Management Science
1993 : JUN, VOL. 39:6, p. 757-776 |
| Asiasana: | LINEAR PROGRAMMING ALGORITHMS TRANSPORT |
| Kieli: | eng |
| Tiivistelmä: | The authors examine and extend decomposition techniques which greatly reduce the amount of work required by such interior point methods as the dual affine scaling and the dual potential reduction algorithms. In an effort to judge the practical viability of the decompositioning, the authors compare the performance of the dual potential reduction algorithm with and without decompositioning over a set of randomly generated transportation problems. Accompanying a theoretical justification of the these techniques, the authors focus on the implementation details and computational results of one such technique. |
SCIMA