A Probing Algorithm for MINLP with Failure Prediction by SVM

  • Giacomo Nannicini
  • Pietro Belotti
  • Jon Lee
  • Jeff Linderoth
  • François Margot
  • Andreas Wächter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6697)


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.


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Biegler, L., Grossmann, I., Westerberg, A.: Systematic Methods of Chemical Process Design. Prentice-Hall, Upper Saddle River (NJ) (1997)Google Scholar
  2. 2.
    Floudas, C.: Global optimization in design and control of chemical process systems. Journal of Process Control 10, 125–134 (2001)CrossRefGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 4.
    Tawarmalani, M., Sahinidis, N.: Global optimization of mixed integer nonlinear programs: A theoretical and computational study. Mathematical Programming 99, 563–591 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Savelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing 6(4), 445–455 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Cortes, C., Vapnik, V.: Support-vector networks. Machine Learning 20, 273–297 (1995)zbMATHGoogle Scholar
  8. 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)CrossRefGoogle Scholar
  9. 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 ViennaGoogle Scholar
  10. 10.
    Sahinidis, N.: Baron: Branch and reduce optimization navigator, user’s manual, version 4.0 (1999),
  11. 11.
    Belotti, P.: Couenne: a user’s manual. Technical report, Lehigh University (2009)Google Scholar
  12. 12.
    Shectman, J., Sahinidis, N.: A finite algorithm for global minimization of separable concave programs. Journal of Global Optimization 12, 1–36 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 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. 14.
    Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, Cambridge (2000)CrossRefzbMATHGoogle Scholar
  15. 15.
    Schölkopf, B., Smola, A.J.: Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, Cambridge (2002)Google Scholar
  16. 16.
    Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Operations Research Letters 33(1), 42–54 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines (2001), Software available at
  18. 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. 19.
    CMU-IBM: Cyber-Infrastructure for MINLP,
  20. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Giacomo Nannicini
    • 1
  • Pietro Belotti
    • 2
  • Jon Lee
    • 3
  • Jeff Linderoth
    • 4
  • François Margot
    • 1
  • Andreas Wächter
    • 3
  1. 1.Tepper School of BusinessCarnegie Mellon UniversityPittsburgh
  2. 2.Dept. of Mathematical SciencesClemson UniversityClemson
  3. 3.IBM T. J. Watson Research CenterYorktown Heights
  4. 4.Industrial and Systems Eng.University of Wisconsin-MadisonMadison

Personalised recommendations