The Bernstein Branch-and-Bound Unconstrained Global Optimization Algorithm for MINLP Problems

  • Bhagyesh V. PatilEmail author
  • P. S. V. Nataraj
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9553)


In this work a Bernstein global optimization algorithm to solve unconstrained polynomial mixed-integer nonlinear programming (MINLP) problems is proposed. The proposed algorithm use a branch-and-bound framework and possesses several new features, such as a modified subdivision procedure, the Bernstein box consistency and the Bernstein hull consistency procedures to prune the solution search space. The performance of the proposed algorithm is numerically investigated and compared with previously reported Bernstein global optimization algorithm on a set of 10 test problems. The findings of the tests establishes the efficacy of the proposed algorithm over the previously reported Bernstein algorithm in terms of the chosen performance metrics.


  1. 1.
    The Mathworks Inc., MATLAB version 7.1 (R14), Natick, MA (2005)Google Scholar
  2. 2.
    Bonami, P., Biegler, L.T., Conn, A., Cornuejols, G., Grossmann, I.E., Laird, C., Lee, J., Lodi, A., Margot, F., Sawaya, N., Wächter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186–204 (2008)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Buchheim, C., D’Ambrosio, C.: Box-constrained mixed-integer polynomial optimization using separable underestimators. In: Lee, J., Vygen, J. (eds.) IPCO 2014. LNCS, vol. 8494, pp. 198–209. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  4. 4.
    D’Ambrosio, C., Lodi, A.: Mixed integer nonlinear programming tools: an updated practical overview. Ann. Oper. Res. 204(1), 301–320 (2013)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Floudas, C.A.: Nonlinear and Mixed-integer Optimization: Fundamentals and Applications. Oxford University Press, New York (1995)zbMATHGoogle Scholar
  6. 6.
    GAMS Development Corp.: GAMS-The solver manuals, Washington, DC (2009)Google Scholar
  7. 7.
    Garloff, J.: The Bernstein algorithm. Interval Comput. 2, 154–168 (1993)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Hansen, E., Walster, G.W.: Global Optimization Using Interval Analysis. CRC Press, New York (2004)zbMATHGoogle Scholar
  9. 9.
    Nataraj, P.S.V., Arounassalame, M.: A new subdivision algorithm for the Bernstein polynomial approach to global optimization. Int. J. Autom. Comput. 4(4), 342–352 (2007)CrossRefGoogle Scholar
  10. 10.
    Nataraj, P.S.V., Arounassalame, M.: Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm. J. Glob. Optim. 49(2), 185–212 (2011)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Patil, B.V., Nataraj, P.S.V., Bhartiya, S.: Global optimization of mixed-integer nonlinear (polynomial) programming problems: the Bernstein polynomial approach. Computing 94(2–4), 325–343 (2012)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Ratz, D., Csendes, T.: On the selection of subdivision directions in interval branch-and-bound methods for global optimization. J. Glob. Optim. 7(2), 183–207 (1995)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Stahl, V.: Interval methods for bounding the range of polynomials and solving systems of nonlinear equations. Ph.D. thesis, Johannes Kepler University, Linz (1995)Google Scholar
  14. 14.
    Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht (2002)CrossRefGoogle Scholar
  15. 15.
    Verschelde, J.: PHC pack, the database of polynomial systems. Technical report, Mathematics Department, University of Illinois, Chicago, USA (2001)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (, which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Authors and Affiliations

  1. 1.Université de NantesNantes Cedex 3France
  2. 2.Systems and Control EngineeringIIT BombayMumbaiIndia

Personalised recommendations