Skip to main content
View expanded cover

International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems

CPAIOR 2011: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems pp 154–169Cite as

A Probing Algorithm for MINLP with Failure Prediction by SVM

  • Conference paper

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

Abstract

Bound tightening is an important component of algorithms for solving nonconvex Mixed Integer Nonlinear Programs. A probing algorithm is a bound-tightening procedure that explores the consequences of restricting a variable to a subinterval with the goal of tightening its bounds. We propose a variant of probing where exploration is based on iteratively applying a truncated Branch-and-Bound algorithm. As this approach is computationally expensive, we use a Support-Vector-Machine classifier to infer whether or not the probing algorithm should be used. Computational experiments demonstrate that the use of this classifier saves a substantial amount of CPU time at the cost of a marginally weaker bound tightening.

Keywords

  • Support Vector Machine
  • Variable Bound
  • Support Vector Machine Model
  • Linear Programming Relaxation
  • Failure Prediction

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-21311-3_15
  • Chapter length: 16 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   69.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-21311-3
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Biegler, L., Grossmann, I., Westerberg, A.: Systematic Methods of Chemical Process Design. Prentice-Hall, Upper Saddle River (NJ) (1997)

    Google Scholar 

  2. Floudas, C.: Global optimization in design and control of chemical process systems. Journal of Process Control 10, 125–134 (2001)

    CrossRef  Google Scholar 

  3. Tawarmalani, M., Sahinidis, N.: Exact algorithms for global optimization of mixed-integer nonlinear programs. In: Pardalos, P., Romeijn, H. (eds.) Handbook of Global Optimization, vol. 2, pp. 65–86. Kluwer Academic Publishers, Dordrecht (2002)

    CrossRef  Google Scholar 

  4. Tawarmalani, M., Sahinidis, N.: Global optimization of mixed integer nonlinear programs: A theoretical and computational study. Mathematical Programming 99, 563–591 (2004)

    MathSciNet  CrossRef  Google Scholar 

  5. Belotti, P., Lee, J., Liberti, L., Margot, F., Wächter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optimization Methods and Software 24(4-5), 597–634 (2008)

    MathSciNet  CrossRef  Google Scholar 

  6. Savelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing 6(4), 445–455 (1994)

    MathSciNet  CrossRef  Google Scholar 

  7. Cortes, C., Vapnik, V.: Support-vector networks. Machine Learning 20, 273–297 (1995)

    MATH  Google Scholar 

  8. Hutter, F., Hoos, H., Leyton-Brown, K.: Automated configuration of mixed integer programming solvers. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 186–202. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  9. Markót, M.C., Schichl, H.: Comparison and automated selection of local optimization solvers for interval global optimization methods. Technical report, Faculty of Mathematics, University of Vienna

    Google Scholar 

  10. Sahinidis, N.: Baron: Branch and reduce optimization navigator, user’s manual, version 4.0 (1999), http://archimedes.scs.uiuc.edu/baron/manuse.pdf

  11. Belotti, P.: Couenne: a user’s manual. Technical report, Lehigh University (2009)

    Google Scholar 

  12. Shectman, J., Sahinidis, N.: A finite algorithm for global minimization of separable concave programs. Journal of Global Optimization 12, 1–36 (1998)

    MathSciNet  CrossRef  Google Scholar 

  13. Smith, E.: On the Optimal Design of Continuous Processes. PhD thesis, Imperial College of Science, Technology and Medicine, University of London (October 1996)

    Google Scholar 

  14. Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, Cambridge (2000)

    CrossRef  Google Scholar 

  15. Schölkopf, B., Smola, A.J.: Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, Cambridge (2002)

    Google Scholar 

  16. Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Operations Research Letters 33(1), 42–54 (2005)

    MathSciNet  CrossRef  Google Scholar 

  17. Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines (2001), Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm

  18. Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib — a collection of test models for Mixed-Integer Nonlinear Programming. INFORMS Journal on Computing 15(1) (2003)

    Google Scholar 

  19. CMU-IBM: Cyber-Infrastructure for MINLP, http://www.minlp.org

  20. Koggalage, R., Halgamuge, S.: Reducing the number of training samples for fast support vector machine classification. Neural Information Processing - Letters 2(3), 57–65 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA

    Giacomo Nannicini & François Margot

  2. Dept. of Mathematical Sciences, Clemson University, Clemson, SC

    Pietro Belotti

  3. IBM T. J. Watson Research Center, Yorktown Heights, NY

    Jon Lee & Andreas Wächter

  4. Industrial and Systems Eng., University of Wisconsin-Madison, Madison, WI

    Jeff Linderoth

Authors
  1. Giacomo Nannicini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pietro Belotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jon Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jeff Linderoth
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. François Margot
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Andreas Wächter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Zuse Institut Berlin, Takustr. 7, 14195, Berlin, Germany

    Tobias Achterberg

  2. Department of Computer Science, University of Toronto, 5 King’s College Rd., M5S 3G8, Toronto, ON, Canada

    J. Christopher Beck

Rights and permissions

Reprints and Permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nannicini, G., Belotti, P., Lee, J., Linderoth, J., Margot, F., Wächter, A. (2011). A Probing Algorithm for MINLP with Failure Prediction by SVM. In: Achterberg, T., Beck, J.C. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2011. Lecture Notes in Computer Science, vol 6697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21311-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21311-3_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21310-6

  • Online ISBN: 978-3-642-21311-3

  • eBook Packages: Computer ScienceComputer Science (R0)