SpringerLink
Log in

A triangulation and fill-reducing initialization procedure for the simplex algorithm

  • Full Length Paper
  • Published:
Mathematical Programming Computation Aims and scope Submit manuscript

Abstract

The computation of an initial basis is of great importance for simplex algorithms since it determines to a large extent the number of iterations and the computational effort needed to solve linear programs. We propose three algorithms that aim to construct an initial basis that is sparse and will reduce the fill-in and computational effort during LU factorization and updates that are utilized in modern simplex implementations. The algorithms rely on triangulation and fill-reducing ordering techniques that are invoked prior to LU factorization. We compare the performance of the CPLEX 12.6.1 primal and dual simplex algorithms using the proposed starting bases against CPLEX using its default crash procedure over a set of 95 large benchmarks (NETLIB, Kennington, Mészáros, Mittelmann). The best proposed algorithm utilizes METIS (Karypis and Kumar in SIAM J Sci Comput 20:359–392, 1998), produces remarkably sparse starting bases, and results in 5% reduction of the geometric mean of the execution time of CPLEX’s primal simplex algorithm. Although the proposed algorithm improves CPLEX’s primal simplex algorithm across all problem types studied in this paper, it performs better on hard problems, i.e., the instances for which the CPLEX default requires over 1000 s. For these problems, the proposed algorithm results in 37% reduction of the geometric mean of the execution time of CPLEX’s primal simplex algorithm. The proposed algorithm also reduces the execution time of CPLEX’s dual simplex on hard instances by 10%. For the instances that are most difficult for CPLEX, and for which CPLEX experiences numerical difficulties as it approaches the optimal solution, the best proposed algorithm speeds up CPLEX by more than 10 times. Finally, the proposed algorithms lead to a natural way to parallelize CPLEX with speedups over CPLEX’s dual simplex of 1.2 and 1.3 on two and four cores, respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Al-Najjar, C., Malakooti, B.: Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods. Comput. Oper. Res. 38, 427–434 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Amestoy, P.R., Davis, T.A., Duff, I.S.: An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 886–905 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Andersen, E.D., Andersen, K.D.: Presolving in linear programming. Math. Program. 71, 221–245 (1995)

    MathSciNet  MATH  Google Scholar 

  4. Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific, Boston (1997)

    Google Scholar 

  5. Bixby, R.E.: Implementing the simplex method: the initial basis. ORSA J. Comput. 4, 267–284 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Carstens, D.M.: Crashing techniques. In: Orchard-Hays, W. (ed.) Advanced Linear-Programming Computing Techniques, pp. 131–139. McGraw-Hill, New York (1968)

    Google Scholar 

  7. Chvátal, V.: Linear Programming. W. H. Freeman, New York (1983)

    MATH  Google Scholar 

  8. Curtis, A.R., Reid, J.K.: On the automatic scaling of matrices for Gaussian elimination. J. Inst. Math. Appl. 10, 118–124 (1972)

    Article  MATH  Google Scholar 

  9. Dantzig, G.B.: Programming in a linear structure. Econometrica 17, 73–74 (1949)

    Article  Google Scholar 

  10. Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)

    Book  MATH  Google Scholar 

  11. Davis, T.A.: Algorithm 915, SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization. ACM Trans. Math. Softw. 38, 8–29 (2011)

    MathSciNet  MATH  Google Scholar 

  12. Davis, T.A., Gilbert, J.R., Larimore, S.I., Ng, E.G.: A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 353–376 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Davis, T.A., Gilbert, J.R., Larimore, S.I., Ng, E.G.: Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 377–380 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201–213 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Elble, J.M., Sahinidis, N.V.: A review of LU factorization in the simplex algorithm. Int. J. Math. Oper. Res. 4, 319–365 (2012)

    Article  MathSciNet  Google Scholar 

  16. Elble, J.M., Sahinidis, N.V.: A review of the LU update in the simplex algorithm. Int. J. Math. Oper. Res. 4, 366–399 (2012)

    Article  MathSciNet  Google Scholar 

  17. Elble, J.M., Sahinidis, N.V.: Scaling linear optimization problems prior to application of the simplex method. Comput. Optim. Appl. 52, 345–371 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  18. Erisman, A.M., Grimes, R.G., Lewis, J.G., Poole Jr., W.G.: A structurally stable modification of Hellerman–Rarick’s \(P^4\) algorithm for reordering unsymmetric sparse matrices. SIAM J. Numer. Anal. 22, 369–385 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  19. Forrest, J.J., Goldfarb, D.: Steepest-edge simplex algorithms for linear programming. Math. Program. 57, 341–374 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  20. Forrest, J.J.H., Tomlin, J.A.: Updated triangular factors of the basis to maintain sparsity in the product form simplex method. Math. Program. 2, 263–278 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  21. Gilbert, J.R., Moler, C.B., Schreiber, R.: Sparse matrices in MATLAB: design and implementation. SIAM J. Matrix Anal. Appl. 13, 333–356 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  22. Goldfarb, D.: On the Bartels–Golub decomposition for linear programming bases. Math. Program. 13, 272–279 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  23. Gould, N.I.M., Reid, J.K.: New crash procedures for large systems of linear constraints. Math. Program. 45, 475–501 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  24. Gould, N.I.M., Toint, P.L.: Preprocessing for quadratic programming. Math. Program. 100, 95–132 (2004)

    MathSciNet  MATH  Google Scholar 

  25. Gülpinar, N., Mitra, G., Maros, I.: Creating advanced bases for large scale linear programs exploiting embedded network structure. Comput. Optim. Appl. 21, 71–93 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  26. Harris, P.M.J.: Pivot selection methods of the Devex LP code. Math. Program. 5, 1–28 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  27. Huangfu, Q., Hall, J.: Parallelizing the dual revised simplex method. Math. Program. Comput. 10, 119–142 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  28. Junior, H.V., Lins, M.P.E.: An improved initial basis for the simplex algorithm. Comput. Oper. Res. 32, 1983–1993 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  29. Kaczmarz, S.: Angenäherte auflösung von systemen linearer gleichungen. Bull. Int. Acad. Pol. Sci. Lett. 35, 355–357 (1937)

    MATH  Google Scholar 

  30. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359–392 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  31. Lenstra, J.K., Rinnoy Kan, A.H.G., Schrijver, A. (eds.): History of Mathematical Programming. CWI North Holland, Amsterdam (1991)

    Google Scholar 

  32. Luh, H., Tsaih, R.: An efficient search direction for linear programming problems. Comput. Oper. Res. 29, 195–203 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  33. Markowitz, H.M.: The elimination form of the inverse and its application to linear programming. Manag. Sci. 3, 255–269 (1957). (Originally at The RAND Corporation, Research Memorandum RM-1452, 1955)

    Article  MathSciNet  MATH  Google Scholar 

  34. Maros, I.: Computational Techniques of the Simplex Method. Kluwer Academic Publishers, Boston (2003)

    Book  MATH  Google Scholar 

  35. Maros, I., Mitra, G.: Strategies for creating advanced bases for large-scale linear programming problems. INFORMS J. Comput. 10, 248–260 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  36. Mészáros, C., Suhl, U.H.: Advanced preprocessing techniques for linear and quadratic programming. OR Spectr. 25, 575–595 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  37. Murtagh, B.A., Saunders, M.A.: MINOS 5.1 User’s Guide. Technical report, Department of Operations Research, Stanford University, Stanford, CA (1987)

  38. Nabli, H.: An overview on the simplex algorithm. Appl. Math. Comput. 210, 479–489 (2009)

    MathSciNet  MATH  Google Scholar 

  39. Nabli, H., Chahdoura, S.: Algebraic simplex initialization combined with the nonfeasible basis methods. Eur. J. Oper. Res. 245, 384–391 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  40. Pan, P.Q.: Linear Programming Computation. Springer, Berlin (2014)

    Book  MATH  Google Scholar 

  41. Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Mineola (1998)

    MATH  Google Scholar 

  42. Ploskas, N., Samaras, N.: GPU accelerated pivoting rules for the simplex algorithm. J. Syst. Softw. 96, 1–9 (2014)

    Article  MATH  Google Scholar 

  43. Ploskas, N., Samaras, N.: A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit. Int. J. Comput. Math. 92, 319–336 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  44. Terlaky, T., Zhang, S.: Pivot rules for linear programming: a survey on recent theoretical developments. Ann. Oper. Res. 46, 203–233 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  45. Tomlin, J.A.: An accuracy test for updating triangular factors. Math. Program. Study 4, 142–145 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  46. Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebr. Discrete Methods 2, 77–79 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  47. Ye, Y.: Eliminating columns in the simplex method for linear-programming. J. Optim. Theory Appl. 63, 69–77 (1989)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Western Macedonia, 50100, Kozani, Greece

    Nikolaos Ploskas

  2. Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, 15213, USA

    Nikolaos V. Sahinidis

  3. Department of Applied Informatics, University of Macedonia, 54636, Thessaloniki, Greece

    Nikolaos Samaras

Authors
  1. Nikolaos Ploskas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nikolaos V. Sahinidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nikolaos Samaras
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nikolaos V. Sahinidis.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary material 1 (pdf 105 KB)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ploskas, N., Sahinidis, N.V. & Samaras, N. A triangulation and fill-reducing initialization procedure for the simplex algorithm. Math. Prog. Comp. 13, 491–508 (2021). https://doi.org/10.1007/s12532-020-00188-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12532-020-00188-1

Keywords

Mathematics Subject Classification

Search

Navigation