Abstract
First, this paper presents the results of experiments with algorithmic techniques for efficiently solving medium and large scale linear and mixed integer programming problems. The techniques presented here are either original or recent.
The solution of a great number of problems has shown that efficient problem solving requires automatic adaptation of algorithmic techniques upon problem characteristics. We show when a given technique should be used for a particular problem.
The last part of this paper describes an attempt to provide a powerful mathematical programming language, allowing an easy programming of specific studies on medium-size models such as the recursive use of LP or the build-up of algorithms based on the simplex method.
All these features have been implemented in the IBM Mathematical Programming System, MPSX/370, and its feature MIP/370. Extensive numerical results and comparisons on real-life problems are provided and commented upon.
Similar content being viewed by others
References
J. Abadie, ed.,Integer and nonlinear programming (North-Holland, Amsterdam, 1970).
R.H. Bartels and G.H. Golub, “The simplex method of linear programming using LU decomposition”,Communications of the Association for Computing Machinery 12 (1969) 266–268, 275–278.
E.M.L. Beale and J.A. Tomlin, “Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables”, in: J. Lawrence, ed.,Proceedings of the fifth IFORS Conference, Tavistock, London, 1970, pp. 447–454.
M. Bénichou, J.M. Gauthier, P. Girodet, G. Hentgès, G. Ribière and O. Vincent, “Experiments in mixed integer linear programming”,Mathematical Programming 1 (1971) 76–94.
R.K. Brayton, F.G. Gustavson and R.A. Willoughby, “Some results on sparse matrices”,Mathematics of Computation 24 (1970) 937–954.
R. Breu and C.A. Burdet, “Branch and bound experiments in 0–1 programming”,Mathematical Programming Study 2 (1974) 1–50.
J. de Buchet, “Expériences et statistiques sur la résolution des programmes linéaires de grandes dimensions”, in: D.B. Hertz and J. Melese, eds.,Proceedings of the fourth IFORS Conference (Wiley, New York, 1966) pp. 3–12.
A. Chang, “Application of sparse matrix methods in electric power system analysis”, in: R. Willoughby, ed.,Sparse matrix proceedings (RA-1, IBM Research Center, Yorktown Heights, New York, 1969) pp. 113–121.
H. Crowder and J.M. Hattingh, “Partially normalized pivot selection in linear programming”,Mathematical Programming Study 4 (1975) 12–25.
A.R. Curtis and J.K. Reid, “On the automatic scaling of matrices for gaussian elimination”,Journal of the Institute of Mathematics and its Applications 10 (1972) 118–124.
G.B. Dantzig, “Compact basis triangularization for the simplex method”, in: R.L. Graves and P. Wolfe, eds.,Recent advances in mathematical programming (McGraw-Hill, New York, 1963) pp. 125–132.
G.B. Dantzig, R.P. Harvey, R.D. McKnight and S.S. Smith, “Sparse matrix techniques in two mathematical programming codes”, in: R.A. Willoughby, ed.,Sparse matrix proceedings (RA-1, IBM Research Center, Yorktown Heights, New York, 1969) pp. 85–99.
J.J.H. Forrest, J.P. Hirst and J.A. Tomlin, “Practical solution of large mixed integer programming problems with UMPIRE”,Management Science 20 (5) (1974) 736–773.
J.J.H. Forrest and J.A. Tomlin, “Updated triangular factors of the basis to maintain sparsity in the product form simplex method”,Mathematical Programming 2 (1972) 263–278.
D. Fulkerson and P. Wolfe, “An algorithm for scaling matrices”,SIAM Review 4 (1962) 142–146.
J.M. Gauthier and G. Ribière, “Experiments in mixed integer programming using pseudo-costs”,Mathematical Programming 12 (1977) 26–47.
A.M. Geoffrion and R.E. Marsten, “Integer programming algorithms: a framework and state-of-the-art survey”,Management Science 18 (9) (1972) 465–491.
H. Greenberg and J. Kalan, “An exact update for Harris' TREAD”,Mathematical Programming Study 4 (1975) 26–29.
M. Guignard and K. Spielberg, “Reduction methods for state enumeration integer programming”, Workshop on Integer programming, Bonn, 1975.
F.G. Gustavson, “Some basic techniques for solving sparse systems of linear equations”, in: D.J. Rose and R.A. Willoughby, eds.,Sparse matrices and their applications (Plenum Press, New York, 1972) pp. 41–52.
P.M.J. Harris, Pivot selection methods of the Devex LP code”,Mathematical Programming Study 4 (1975) 30–57.
E. Hellerman and D. Rarick, “The partitioned preassigned pivot procedure (P4)”, in: D.J. Rose and R.A. Willoughby, eds.,Sparse matrices and their applications (Plenum Press, New York 1972) pp. 67–76.
IBM Mathematical Programming System Extended/370 (MPSX/370), Program reference manual, SH19-1095 — Mixed Integer Programming/370 (MIP/370), Program reference manual, SH19-1099 (December 1974).
E. Johnson and K. Spielberg, “Inequalities in branch and bound programming”, in: R. Cottle and J. Krarup, eds.,Optimization Methods (The English University Press, London, 1974).
H. Markowitz, “The elimination form of the inverse and its application to linear programming”,Management Science 3 (1957) 255–269.
W. Orchard-Hayes,Advanced linear programming computing techniques (McGraw-Hill, New York, 1968).
M.A. Saunders, “A fast, stable implementation of the simplex method using Bartels—Golub updating”, in: J.R. Bunch and D.J. Rose, eds.,Sparse matrix computations (Academic Press, New York, 1976) pp. 213–226.
L. Slate, Private communication, IBM Corp. DPD (1972).
D. Smith, “Data logistics for matrix inversion”, in: R.A. Willoughby, ed.,Sparse matrix proceedings (RA-1, IBM Research Center, Yorktown Heights, New York, 1969) pp. 127–138.
D.J. Rose and R.A. Willoughby, eds.,Sparse matrices and their applications (Plenum Press, New York, 1972).
A. van der Sluis, “Condition numbers and equilibration of matrices”,Numerische Mathematik 14 (1969) 14–23.
A. van der Sluis, “Condition, equilibration and pivoting in linear algebraic systems”,Numerische Mathematik 15 (1970) 74–86.
J.A. Tomlin, “Pivoting for size and sparsity in linear programming inversion routines”,Journal of the Institute of Mathematics and its Applications 10 (1972) 289–295.
J.A. Tomlin, “On pricing and backward transformation in linear programming”,Mathematical Programming 6 (1974) 42–47.
J.A. Tomlin, “On scaling linear programming problems”,Mathematical Programming Study 4 (1975) 146–166.
P. Wolfe, “A technique for resolving degeneracy in linear programming”,SIAM Journal 11 (1963) 205–211.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Benichou, M., Gauthier, J.M., Hentges, G. et al. The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results. Mathematical Programming 13, 280–322 (1977). https://doi.org/10.1007/BF01584344
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584344