An investigation of interior-point algorithms for the linear transportation problem

SIAM Journal on Scientific Computing

Volumn 17, Issue 5, 1996, Pages 1202-1223

  Portugal, L ^a   Bastos, F ^b   Judice J ^a   Paixao J ^c   Terlaky, T ^d,e  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^c UNIVERSITY OF LISBON   (Portugal)

^d DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^e EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

Interior point algorithms; Large scale problems; Linear transportation models; Preconditioned conjugate gradient methods

Indexed keywords

EID: 0000995669     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827593258280     Document Type: Article

References (39)

1. I. ADLER, N. KARMARKAR, M. RESENDE, AND G. VEIGA, Data structures and programming techniques for the implementation of Karmarkar's algorithm, ORSA J. Comput., 1 (1989), pp. 84-106.
2. I. ADLER AND R. MONTEIRO, Limiting behavior of the affine scaling continuous trajectories for linear programming problems, Math. Programming, 50 (1989), pp. 29-51.
3. I. ADLER, M. RESENDE, G. VEIGA, AND N. KARMARKAR, An implementation of Karmarkar's algorithm for linear programming, Math. Programming, 44 (1989), pp. 297-335.
4. M. ARIOLI, I. DUFF, AND D. RUIZ, Stopping criteria for iterative solvers, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 138-144.
5. E. BARNES, A variation on Karmarkar's algorithm for solving linear programming problems, Math. Programming, 36 (1986), pp. 174-182.
6. R. BIXBY, J. GREGORY, I. LUSTIG, R. MARSTEN, AND D. SHANNO, Very large-scale linear programming: A case study in combining interior point and simplex methods, Oper. Res., 40 (1992), pp. 885-897.
7. T. CARPENTER, I. LUSTIG, J. MULVEY, AND D. SHANNO, Higher Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives, Rutcor Research Report 67.90, Rutgers University, New Brunswick, NJ, 1990.
8. I. DIKIN, Iterative solution of problems of linear and quadratic programming, Soviet Math. Dokl., 8 (1967), pp. 674-675.
9. P. GILL, W. MURRAY, AND M. WRIGHT, Practical Optimization, Academic Press, New York, 1981.
10. G. GOLUB AND C. V. LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1983.
11. L. HALL AND R. VANDERBEI, Two-Third is Sharp for Affine Scaling, Tech. report, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ, 1992.
12. B. JANSEN, C. ROOS, T. TERLAKY, AND J. VIAL, Primal-dual algorithms for linear programming based on the logarithmic barrier method, J. Optim. Theory Appl., 83 (1994), pp. 1-26.
13. A. JOSHI, S. GOLDSTEIN, AND P. VAIDYA, A fast implementation of a path-following algorithm for maximizing a linear function over a network polytope, in Network Flows and Matching: First DIMACS Implementation Challenge, D. Johnson and C. McGeoch, eds., American Mathematical Society, Providence, RI, 1993, pp. 267-298.
14. J. KALISKI AND Y. YE, A decomposition variant of the potential reduction algorithm for linear programming, Management Sci., 39 (1993), pp. 757-776.
15. N. KARMARKAR, A new polynomial-time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
16. J. KENNINGTON AND R. HELGASON, Algorithms for Network Programming, John Wiley & Sons, New York, 1980.
17. D. KLINGMAN, A. NAPIER, AND J. STUTZ, Netgen: A program for generating large scale capacitated assignment, transportation and minimum cost flow network problems. Management Sci., 20 (1974), pp. 814-821.
18. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A primal-dual interior point algorithm for linear programming, in Progress in Mathematical Programming, Interior Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, 1989, pp. 29-47.
19. _, An O(√nl) iteration potential reduction algorithm for linear complementarity problems, Math. Programming, 50 (1991), pp. 331-342.
20. E. KRANICH, SIAG/OPT Views-and-News, a forum for the SIAM Activity Group on Optimization, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1992.
21. I. LUSTIG, R. MARSTEN, AND D. SHANNO, The primal-dual interior point method on the Cray supercomputer, in Large-Scale Numerical Optimization, SIAM Proc. in Applied Mathematics, Ithaca, NY, 1989, T. Coleman and Y. Li, eds., Society for Industrial and Applied Mathematics, Philadelphia, PA, 1990, pp. 70-80.
22. I. LUSTIG, R. MARSTEN, AND D. SHANNO, The primal-dual interior point method on the Cray supercomputer, in Large-Scale Numerical Optimization, SIAM Proc. in Applied Mathematics, Ithaca, NY, 1989, T. Coleman and Y. Li, eds., Society for Industrial and Applied Mathematics, Philadelphia, PA, 1990, pp. 70-80.
23. _, Interior method vs. simplex method: Beyond netlib, COAL Newsletter, 19 (1991), pp. 41-44.
24. _, On implementing Mehrotra's predictor-corrector interior-point method for linear programming, SIAM J. Optim., 2 (1992), pp. 435-449.
25. _, Interior methods: Computational state of the art, ORSA J. Computing, 6 (1994), pp. 1-14.
26. R. MARSTEN, M. SALTZMAN, D. SHANNO, G. PIERCE, AND J. BALLINTUN, Implementation of a dual affine interior point algorithm for linear programming, ORSA J. Comput., 1 (1989), pp. 287-297.
27. K. MCSHANE, C. MONMA, AND D. SHANNO, An implementation of a primal-dual interior-point method for linear programming, ORSA J. Comput., 1 (1989), pp. 70-83.
28. S. MEHROTRA, On the Implementation of a (Primal-Dual) Interior-Point Method, Tech. report 90-03, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL, 1990.
29. C. MONMA AND A. MORTON, Computational experience with a dual affine variant of Karmarkar's method for linear programming, Oper. Res. Lett., 6 (1987), pp. 177-182.
30. R. MONTEIRO AND I. ADLER, Interior path following primal-dual algorithms. Part I: Linear programming, Math. Programming, 44 (1989), pp. 27-41.
31. R. MONTEIRO, I. ADLER, AND M. RESENDE, A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension, Math. Oper. Res., 15 (1990), pp. 191-214.
32. M. MURAMATSU AND T. TSUCHIYA, A convergence analysis of a long-step variant of the projective scaling algorithm, Research memorandum, The Institute of Statistical Mathematics, 4-6-7 Minami-Azabu, Minato-Ku, Tokyo 106, Japan, 1992.
33. G. NEMHAUSER AND L. WOLSEY, Integer and Combinatorial Optimization, John Wiley & Sons, New York, 1988.
34. M. RESENDE, T. TSUCHIYA, AND G. VEIGA, Identifying the optimal face of a network linear program with a globally convergent interior point method, in Large Scale Optimization: State of the Art, H. Hager, D. Hearn, and P. Pardalos, eds., Kluwer Academic Publishers, Norwell, MA, 1994, pp. 362-386.
35. M. RESENDE AND G. VEIGA, An efficient implementation of a network interior point method, in Networks Flow and Matching: First DIMACS Implementation Challenge, Vol. 12, D. Johnson and C. McGeoch, eds., American Mathematical Society, Providence, RI, 1993, pp. 299-384.
36. _, An implementation of the dual affine scaling algorithm for minimum-cost flow on bipartite uncapacitated networks, SIAM J. Optim., 3 (1993), pp. 516-537.
37. R. VANDERBEI AND J. LAGARIAS, I. Dikin's convergence result for the affine-scaling algorithm, in Contemporary Mathematics, Mathematical Developments Arising from Linear Programming, Proc. Joint Summer Research Conference, Bowdoin College, Brunswick, Maine, 1988, J. Lagarias and M. Todd, eds., 1990, pp. 109-119.
38. R. VANDERBEI, M. MEKETON, AND B. FREEDMAN, A modification of Karmarkar's linear programming algorithm, Algorithmica, 1 (1986), pp. 395-407.
39. Q. YEH, A Reduced Dual Affine Scaling Algorithm for Solving Assignment and Transportation Problems, Ph.D. thesis, Columbia University, New York, NY, 1989.