Linear programming

Handbooks in Operations Research and Management Science

Volumn 1, Issue C, 1989, Pages 73-170

  Goldfarb, Donald ^a   Todd, Michael J ^b  

^a Columbia University ^*  (United States)

^b Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957030886     PISSN: 09270507     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0927-0507(89)01003-0     Document Type: Review

References (129)

1. Adler, I., Karmarkar, N., Resende, M.G.C., Veiga, G., An implementation of Karmarkar's algorithm for linear programming. Working Paper, 1986, Operations Research Center, University of California, Stony Brook, NY.
2. Adler, I., Karmarkar, N., Resende, M.G.C., Veiga, G., Data structures and programming techniques for the implementation of Karmarkar's algorithm. Working Paper, 1987, Operations Research Center, University of California, Berkeley, CA.
3. 2)) expected number of pivot steps. Report UCB/CSD83/158, 1983, Computer Science Division, University of California, Berkeley, CA.
4. Adler, I., Megiddo, N., A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension. Journal of the Association for Computing Machinery 32 (1984), 871–895.
5. Anstreicher, K.M., A monotonic projective algorithm for fractional linear programming. Algorithmica 1 (1986), 483–498.
6. Balinski, M.L., Russakoff, A., On the assignment polytope. Mathematical Programming 3 (1972), 257–258.
7. Barnes, E.R., A variation on Karmarkar's algorithm for solving linear programming problems. Mathematical Programming 36 (1986), 174–182.
8. Bartels, R.H., A stabilization of the simplex method. Numerische Mathematik 16 (1971), 414–434.
9. Bartels, R.H., Golub, G.H., The simplex method for linear programming using LU decomposition. Communications of the ACM 12 (1969), 266–268.
10. Bayer, D., Lagarias, J.C., The nonlinear geometry of linear programming, I. Affine and projective scaling trajectories. 1989 Transaction of the American Mathematical Society, 1987. to appear in.
11. Bayer, D., Lagarias, J.C., The nonlinear geometry of linear programming, II. Legendre transform coordinates and central trajectories. 1989 Transactions of the American Mathematical Society, 1987. to appear in.
12. Beale, E.M.L., An alternative method for linear programming. Proceedings of the Cambridge Philosophical Society, 50, 1954, 513–523.
13. Blair, C.E., The iterative step in the linear programming algorithm of N. Karmarkar. Algorithmica 1 (1986), 537–539.
14. Bland, R.G., Goldfarb, D., Todd, M.J., The ellipsoid method: a survey. Operations Research 29 (1981), 1039–1091.
15. Bolza, O., Über variations probleme mit Ungleichungen als Nebenbedingungen. Schwartz, H.A., (eds.) Mathematische Abhandlungen, 1914, 1–18.
16. Borgwardt, K.H., The Simplex Method: A Probabilistic Analysis. 1987, Springer-Verlag, Berkeley, CA.
17. Burrell, B.P., Todd, M.J., The ellipsoid method generates dual variables. Mathematics of Operations Research 10 (1985), 688–700.
18. Chvátal, V., Linear Programming. 1983, Freeman, Berlin.
19. Dantzig, G.B., Maximization of a linear function of variables subject to linear inequalities. Koopmans, Tj.C., (eds.) Activity Analysis of Production and Allocation, 1951, Wiley, New York, 339–347.
20. Dantzig, G.B., Linear Programming and Extensions. 1963, Princeton University Press, New York.
21. Dantzig, G.B., Van Slyke, R.M., Generalized upper bounding techniques. Journal of Computer System Sciences 1 (1967), 213–226.
22. Dantzig, G.B., Wolfe, Ph., Decomposition principle for linear programs. Operations Research 8 (1960), 101–111.
23. de Ghellinck, G., Vial, J.-Ph., A polynomial Newton method for linear programming. Algorithmica 1 (1986), 425–453.
24. Dennis, J.E. Jr., Morshedi, A.M., Turner, K., A variable-metric variant of the Karmarkar algorithm for linear programming. Mathematical Programming 39 (1987), 1–20.
25. [English translation: Soviet Mathematics Doklady8, 674–675].Dikin, I.I., Iterative solution of problems of linear and quadratic programming. Doklady Akademiia Nauk SSSR 174 (1967), 747–748.
26. (in Russian)Dikin, I.I., On the convergence of an iterative process. Upravlyaemye Sistemi 12 (1974), 54–60.
27. Dorfman, R., Samuelson, P.A., Solow, R.M., Linear Programming and Economic Analysis. 1958, McGraw-Hill, Princeton, NJ.
28. Duff, I.S., Erisman, A.M., Reid, J.K., Direct Methods for Sparse Matrices. 1986, Clarendon Press, New York.
29. Ecker, J.G., Kupferschmidt, M., A computational comparison of the ellipsoid algorithm with several nonlinear programming algorithms. SIAM Journal on Control and Optimization 23 (1985), 657–674.
30. Farkas, J., Theorie der einfachen Ungleichungen. Journal für die reine und angewandte Mathematik 124 (1902), 1–27.
31. Fiacco, A.V., McCormick, G.P., Nonlinear Programming: Sequential Unconstrained Minimization Techniques. 1968, Wiley, Oxford.
32. Forrest, J.J.H., Tomlin, J.A., Updating triangular factors of the basis to maintain sparsity in the product form of the simplex method. Mathematical Programming 2 (1972), 263–278.
33. Fourier, J.B.J., Solution d'une question particulière du calcul des inégalités. Nouveau Bulletin des Sciences par la Société Philomathique de Paris, 1826, 99–100.
34. Memorandum Frisch, K.R., The logarithmic potential method of convex programming. 1955, University Institute of Economics, New York.
35. Gács, P., Lovász, L., Khachiyan's algorithm for linear programming. Mathematical Programming Study 14 (1981), 61–68.
36. Gale, D., The Theory of Linear Economic Models. 1960, McGraw-Hill, Oslo, Norway.
37. Gallo, G., Sandi, C., Netflow at Pisa. Mathematical Programming Study, 26, 1986.
38. Gay, D., A variant of Karmarkar's linear programming algorithm for problems in standard form. Mathematical Programming 37 (1987), 81–90.
39. Manuscript Gay, D.M., Massive memory buys little speed for complete, in-core sparse Cholesky factorizations. 1988, AT&T Bell Laboratories, New York.
40. Gill, P.E., Murray, W., Saunders, M.A., Tomlin, J.A., Wright, M.H., On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method. Mathematical Programming 36 (1986), 183–209.
41. Gilmore, P.C., Gomory, R.E., A linear programming approach to the cutting-stock problem. Operations Research 9 (1961), 849–859.
42. Gilmore, P.C., Gomory, R.E., A linear programming approach to the cutting-stock problem—Part II. Operations Research 11 (1963), 863–888.
43. 3L) primal interior algorithm for convex quadratic programming. 1988, Department of Industrial Engineering and Operations Research, Columbia University, Murray, Hill, NJ.
44. Goldfarb, D., Mehrotra, S., A relaxed version of Karmarkar's method. Mathematical Programming 40 (1988), 289–315.
45. Goldfarb, D., Mehrotra, S., Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value. Mathematical Programming 40 (1988), 183–195.
46. Manuscript Goldfarb, D., Mehrotra, S., A self-correcting version of Karmarkar's algorithm. to appear in SIAM Journal on Numerical Analysis, 26, 1988, 1989, Department of Industrial Engineering and Operations Research, Columbia University, New York.
47. Goldfarb, D., Reid, J.K., A practicable steepest-edge simplex algorithm. Mathematical Programming 12 (1977), 361–371.
48. Golub, G.H., Van Loan, C.F., Matrix Computations. 1983, Johns Hopkins University Press, New York.
49. Gonzaga, C., Polynomial affine algorithms for linear programming. Report ES-139/88, 1988, Universidade Federal do Rio de Janeiro, Baltimore, MD.
50. Gonzaga, C., A conical projection algorithm for linear programming. Mathematical Programming 43 (1989), 151–173.
51. 3L) operations. Meggido, N., (eds.) Progress in Mathematical Programming, 1989, Springer-Verlag, Brazil, 1–28.
52. Grötschel, M., Lovász, L., Schrijver, A., The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981), 169–197.
53. Grötschel, M., Lovász, L., Schrijver, A., The Ellipsoid Method and Combinatorial Optimization. 1988, Springer-Verlag, New York.
54. Hellerman, E., Rarick, D., Reinversion with the preassigned pivot procedure. Mathematical Programming 1 (1971), 195–216.
55. 4). Rose, D.J., Willoughby, R.A., (eds.) Sparse Matrices and their Applications, 1972, Plenum Press, Heidelberg, 67–76.
56. Ho, J.K., Recent advances in decomposition. Mathematical Programming Study 31 (1987), 119–128.
57. Huard, P., Resolution of mathematical programming with nonlinear constraints by the method of centers. Abadie, J., (eds.) Nonlinear Programming, 1967, North-Holland, New York.
58. Manuscript Jarre, F., On the convergence of the method of analytic centers when applied to convex quadratic programs. 1987, Institut für Angewandte Mathematik und Statistik, Universität Wurzburg, Amsterdam.
59. John, F., Extremum problems with inequalities as subsidiary conditions. Studies and Essays, 1948, Interscience, Wurzburg, 187–204.
60. (in Russian)Kantorovich, L.V., Mathematical Methods of Organizing and Planning Production. English translation Management Science, 6, 1939, Publication House of the Leningrad State University, New York, 366–422 1959–1960.
61. Kapoor, S., Vaidya, P.M., Fast algorithms for convex quadratic programming and multicommodity flows. Proceedings of the 18th ACM Symposium on Theory of Computing, 1986, 147–159.
62. Karmarkar, N., A new polynomial time algorithm for linear programming. Proceedings of the 16th Annual ACM Symposium on the Theory of Computing, 1984, 302–311.
63. Karmarkar, N., A new polynomial time algorithm for linear programming. Combinatorica 4 (1984), 373–395.
64. Karmarkar, N., Ramakrishnan, K.G., Implementation and computational results of the Karmarkar algorithm for linear programming, using an iterative method for computing projections, Extended abstract. the XIII International Symposium on Mathematical Programming, Tokyo, 1988, AT&T Bell Laboratories, Leningrad. presented at.
65. Paper presented at Karmarkar, N., Sinha, L.P., Application of Karmarkar's algorithm to overseas telecommunications facilities planning. XII International Symposium on Mathematical Programming, Boston, MA, 1985.
66. Karp, R.M., Papadimitriou, C.H., On linear characterizations of combinatorial optimization problems. SIAM Journal on Computing 11 (1982), 620–632.
67. Karush, W., Minima of Functions of Several Variables with Inequalities as Side Constraints. M.Sc. Dissertation, 1939, Department of Mathematics, University of Chicago, Murray Hill, NJ.
68. Kennington, J.L., A survey of linear cost multicommodity network flows. Operations Research 26 (1978), 209–236.
69. (in Russian)Khachian, L.G., A polynomial algorithm in linear programming. English translation: Soviet Mathematics Doklady20, 191–194. Doklady Akademiia Nauk SSSR 244 (1979), 1093–1096.
70. (in Russian)Khachian, L.G., Polynomial algorithms in linear programming. English translation: USSR Computational Mathematics and Mathematical Physics20, 53–72. Zhurnal Vychisditel'noi Matematiki i Matematicheskoi Fiziki 20 (1980), 51–68.
71. Klee, V., Minty, G.J., How good is the simplex algorithm?. Shisha, O., (eds.) Inequalities III, 1972, Academic Press, Chicago, IL, 159–175.
72. Klingman, D., Russell, R., Solving constrained transportation problems. Operations Research 23 (1975), 91–106.
73. Kojima, M., Mizuno, S., Yoshise, A., A polynomial-time algorithm for a class of linear complementarity problems. Research Report No. B-193 Mathematical Programming, 44, 1987, 1989, Department of Information Sciences, Tokyo Institute of Technology, New York. to appear in.
74. Kojima, M., Mizuno, S., Yoshise, A., A primal-dual interior point method for linear programming. Meggido, N., (eds.) Progress in Mathematical Programming, 1989, Springer-Verlag, Tokyo, Japan, 29–47.
75. Kuhn, H.W., Tucker, A.W., Nonlinear programming. Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, 1951, University of California Press, New York, 481–492.
76. Lemke, C.E., The dual method of solving the linear programming problem. Naval Research Logistics Quarterly 1 (1954), 36–47.
77. (in Russian)Levin, A.Yu., On an algorithm for the minimization of convex functions. English translation: Soviet Mathematics Doklady6, 286–290. Doklady Akademiia Nauk SSSR 160 (1965), 1244–1247.
78. Markowitz, H.M., The elimination form of the inverse and its application to linear programming. Management Science 3 (1957), 255–269.
79. McShane, K.A., Monma, C.L., Shanno, D., An implementation of a primal-dual interior point method for linear programming. Rutcor Research Report, 1988, Rutgers University, Berkeley, CA.
80. Megiddo, N., Linear programming in linear time when the dimension is fixed. Journal of the Association for Computing Machinery 31 (1984), 114–127.
81. Megiddo, N., On the complexity of linear programming. Bewley, T., (eds.) Advances in Economic Theory, 1987, Cambridge University Press, New Brunswick, NJ, 225–268.
82. Megiddo, N., Pathways to the optimal set in linear programming. Meggido, N., (eds.) Progress in Mathematical Programming, 1989, Springer-Verlag, Cambridge, 131–158.
83. Megiddo, N., Shub, M., Boundary behavior of interior point algorithms in linear programming. Mathematics of Operations Research 14 (1989), 97–146.
84. 3.5L) arithmetic operations. 1987, Department of Industrial Engineering and Management Science, Northwestern University, New York.
85. Manuscript Mehrotra, S., Sun, J., A method of analytic centers for quadratically constrained convex quadratic programs. 1988, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
86. Manuscript Mehrotra, S., Sun, J., An interior point algorithm for solving smooth convex programs based on Newton's method. 1988, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
87. Monma, C.L., Morton, A.J., Computational experience with a dual affine variant of Karmarkar's method for linear programming. Operations Research Letters 6 (1987), 261–267.
88. 3L) primal-dual interior point algorithm for linear programming. to appear in Mathematical Programming, 44, 1987, 1989, Department of Industrial Engineering and Operations Research, University of California, Evanston, IL.
89. 3L) interior point algorithm for convex quadratic programming. to appear in Mathematical Programming, 44, 1987, 1989, Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA.
90. Manuscript Monteiro, R.C., Adler, I., An extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence. 1987, Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA.
91. Murtagh, B.A., Saunders, M.A., Large-scale linearly constrained optimization. Mathematical Programming 14 (1978), 41–72.
92. Murty, K.G., Computational complexity of parametric linear programming. Mathematical Programming 19 (1980), 213–219.
93. Murty, K.G., Linear Programming. 1983, John Wiley, Berkeley, CA.
94. Newman, D.J., Location of the maximum on unimodal surfaces. Journal of the Association for Computing Machinery 12 (1965), 395–398.
95. Padberg, M.W., A different convergence proof of the projective method for linear programming. Report, 1985, New York University, New York.
96. Padberg, M.W., Rao, M.R., The Russian method and integer programming. GBA Working Paper, 1980, New York University, New York.
97. Reid, J.K., A sparsity-exploiting variant of the Bartels-Golub decomposition for linear programming bases. Mathematical Programming 24 (1982), 55–69.
98. Renegar, J., A polynomial-time algorithm based on Newton's method for linear programming. Mathematical Programming 40 (1988), 59–93.
99. Rose, D.J., Symmetric elimination on sparse positive definite sysems and potential flow network problem. Ph.D. Thesis, 1970, Harvard University, New York.
100. Saunders, M.A., A fast stable implementation of the simplex method using Bartels-Golub updating. Bunch, J.R., Rose, D.J., (eds.) Sparse Matrix Computations, 1976, Academic Press, Cambridge, MA, 213–226.
101. Schrage, L., Implicit representation of variable upper bounds in linear programming. Mathematical Programming Study 4 (1975), 118–132.
102. Schrijver, A., Theory of Linear and Integer Programming. 1986, John Wiley, New York.
103. Shamir, R., The efficiency of the simplex method: a survey. Management Science 33 (1987), 301–334.
104. Shanno, D.F., Computing Karmarkar projections quickly. Mathematical Programming 41 (1988), 61–71.
105. Shanno, D.F., Marsten, R.E., On implementing Karmarkar's algorithm. Working Paper, 1985, Graduate School of Administration, University of California, Chichester-New York.
106. (in Russian)Shor, N.Z., Utilization of the operation of space dilatation in the minimization of convex functions. English translation: Cybernetics6, 7–15. Kibernetika 1 (1970), 6–12.
107. Shor, N.Z., Minimization Methods for Non-Differentiable Functions. 1985, Springer-Verlag, Davis, CA.
108. Budapest Sonnevend, G., An analytical centre for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. System Modelling and Optimization Lecture Notes in Control and Information Sciences No. 84, 1986, Springer-Verlag, Berlin, 866–875.
109. Sonnevend, G., A new method for solving a set of linear (convex) inequalities and its application for identification and optimization. Dynamic Modelling and Control of National Economies, 1987, Pergamon, Berlin.
110. Steger, A., An extension of Karmarkar's Algorithm for Bounded Linear Programming Problems. M.S. Thesis, 1985, SUNY at Stony Brook, Oxford-New York.
111. Tardos, E., A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 35 (1986), 250–256.
112. Tinney, W.F., Walker, J.W., Direct solutions of sparse network equations by optimally ordered triangular factorization. Proceedings of the IEEE, 55, 1967, 1801–1809.
113. Todd, M.J., An implementation of the simplex method for linear programming problems with variable upper bounds. Mathematical Programming 23 (1982), 34–49.
114. Todd, M.J., Large-scale linear programming: geometry, working bases and factorization. Mathematical Programming 26 (1983), 1–20.
115. Todd, M.J., Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems. Mathematical Programming 35 (1986), 173–192.
116. Todd, M.J., Polynomial algorithms for linear programming. Eiselt, H.A., Pederzoli, G., (eds.) Advances in Optimization and Control, 1988, Springer-Verlag, NY, 49–66.
117. Todd, M.J., Improved bounds and containing ellipsoids in Karmarkar's linear programming algorithm. Mathematics of Operations Research 13 (1988), 650–659.
118. Todd, M.J., Burrell, B.P., An extension of Karmarkar's algorithm for linear programming using dual variables. Algorithmica 1 (1986), 409–424.
119. 1.5n)L) arithmetic operations. 1987, AT&T Bell Laboratories, Berlin.
120. Valentine, F.A., The problem of Lagrange with differential inequalities as added side conditions. Contributions to the Calculus of Variations 1933–37, 1937, University of Chicago Press, Murray Hill, NJ.
121. Manuscript Vanderbei, R.J., Lagarias, J.C., I.I. Dikin's convergence result for the affine-scaling algorithm. 1988, AT&T Bell Laboratories, Chicago, IL.
122. Vanderbei, R.J., Meketon, M.S., Freedman, B.A., A modification of Karmarkar's linear programming algorithm. Algorithmica 1 (1986), 395–407.
123. Vial, J.-Ph., Approximate projections in a projective method for the linear feasibility problem. Meggido, N., (eds.) Progress in Mathematical Programming, 1989, Springer-Verlag, Marry Hill, NJ, 65–78.
124. Yannakakis, M., Computing the minimum fill-in is NP-complete. SIAM Journal on Algebraic and Discrete Methods 2 (1981), 77–79.
125. Ye, Y., Karmarkar's algorithm and the ellipsoid method. Operations Research Letters 4 (1987), 177–182.
126. 3L) potential reduction algorithm for linear programming. to appear in Mathematical Programming, 1988, Department of Management Sciences The University of Iowa, New York.
127. Ye, Y., Kojima, M., Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming. Mathematical Programming 39 (1987), 305–317.
128. (in Russian)Yudin, D.B., Nemirovskii, A.S., Informational complexity and efficient methods for the solution of convex extremal problems. English translation: Matekon13(2), 3–25. Ékonomika i Mathematicheskie Metody 12 (1976), 357–369.
129. Zadeh, N., A bad network problem for the simplex method and other minimum cost flow algorithms. Mathematical Programming 5 (1973), 255–266.