Skip to main content

Parallelization of the FICO Xpress-Optimizer

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9725))

Abstract

Many optimization problems arising in practice can be modeled as mixed integer programs (MIPs). In this paper, we present the new parallelization concept for the state-of-the-art MIP solver FICO Xpress-Optimizer. A natural precondition to achieving reasonabling speedups from parallelization is maintaining a high workload of the available computational resources. At the same time, reproducibility and reliability are key requirements for mathematical optimization software; solvers like the FICO Xpress-Optimizer are expected to be deterministic. The resulting synchronization latencies render the goal of a satisfying workload a challenge in itself.

We address this challenge by following a partial information approach and separating the concepts of simultaneous tasks and independent threads from each other. Our computational results indicate that this leads to a much higher CPU workload and thereby to an improved scaling on modern high-performance CPUs. As an added value, the solution path that the FICO Xpress-Optimizer takes is not only deterministic in a fixed environment, but, to a certain extent, thread-independent.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Those were the instances rocII-4-11, ns1766074, aflow40b, bnatt350, csched010, danoint, dfn-gwin-UUM, gmu-35-40, iis-100-0-cov, m100n500k4r1, n3div36, neos-1337307, neos18, neos-849702, neos-916792, newdano, noswot, ns1830653, pg5_34, pigeon-10, ran16x16, reblock67, rmine6, sp98ic, timtab1, vpphard, bab5, glass4, iis-bupa-cov.

References

  1. Achterberg, T.: Constraint integer programming. Technische Universität Berlin (2007)

    Google Scholar 

  2. Dantzig, G., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8(1), 101–111 (1960)

    Article  MATH  Google Scholar 

  3. FICO Xpress-Optimizer, Reference Manual. http://www.fico.com/xpress

  4. Fischetti, M., Lodi, A., Monaci, M., Salvagnin, D., Tramontani, A.: Improving branch-and-cut performance by random sampling. Math. Programm. Comput. 1–20 (2015)

    Google Scholar 

  5. Fischetti, M., Monaci, M., Salvagnin, D.: Self-splitting of workload in parallel computation. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 394–404. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  6. Huangfu, Q., Hall, J.: Parallelizing the dual revised simplex method. Technical report 1503.01889, ArXiv e-prints (2015)

    Google Scholar 

  7. Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Progam. Comput. 3, 103–163 (2011)

    Article  MathSciNet  Google Scholar 

  8. Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497–520 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  9. Laundy, R., Perregaard, M., Tavares, G., Tipi, H., Vazacopoulos, A.: Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study. Inf. J. Comput. 21(2), 304–313 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)

    Book  MATH  Google Scholar 

  11. Ralphs, T.K., Ladányi, L., Saltzman, M.J.: Parallel branch, cut and price for large-scale discrete optimization. Math. Program. B 98(1–3), 253–280 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  12. Shinano, Y., Achterberg, T., Berthold, T., Heinz, S., Koch, T.: ParaSCIP: a parallel extension of SCIP. Competence in High Performance Computing 2010, pp. 135–148. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Timo Berthold .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Berthold, T., Farmer, J., Heinz, S., Perregaard, M. (2016). Parallelization of the FICO Xpress-Optimizer. In: Greuel, GM., Koch, T., Paule, P., Sommese, A. (eds) Mathematical Software – ICMS 2016. ICMS 2016. Lecture Notes in Computer Science(), vol 9725. Springer, Cham. https://doi.org/10.1007/978-3-319-42432-3_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42432-3_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42431-6

  • Online ISBN: 978-3-319-42432-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics