IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v91y2025i2d10.1007_s10898-023-01345-1.html
   My bibliography  Save this article

Global optimization of mixed-integer nonlinear programs with SCIP 8

Author

Listed:
  • Ksenia Bestuzheva

    (Zuse Institute Berlin)

  • Antonia Chmiela

    (Zuse Institute Berlin)

  • Benjamin Müller

    (Zuse Institute Berlin)

  • Felipe Serrano

    (Zuse Institute Berlin)

  • Stefan Vigerske

    (c/o Zuse Institute Berlin)

  • Fabian Wegscheider

    (Zuse Institute Berlin)

Abstract

For over 10 years, the constraint integer programming framework SCIP has been extended by capabilities for the solution of convex and nonconvex mixed-integer nonlinear programs (MINLPs). With the recently published version 8.0, these capabilities have been largely reworked and extended. This paper discusses the motivations for recent changes and provides an overview of features that are particular to MINLP solving in SCIP. Further, difficulties in benchmarking global MINLP solvers are discussed and a comparison with several state-of-the-art global MINLP solvers is provided.

Suggested Citation

  • Ksenia Bestuzheva & Antonia Chmiela & Benjamin Müller & Felipe Serrano & Stefan Vigerske & Fabian Wegscheider, 2025. "Global optimization of mixed-integer nonlinear programs with SCIP 8," Journal of Global Optimization, Springer, vol. 91(2), pages 287-310, February.
  • Handle: RePEc:spr:jglopt:v:91:y:2025:i:2:d:10.1007_s10898-023-01345-1
    DOI: 10.1007/s10898-023-01345-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-023-01345-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10898-023-01345-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Arthur F. Veinott, 1967. "The Supporting Hyperplane Method for Unimodal Programming," Operations Research, INFORMS, vol. 15(1), pages 147-152, February.
    2. Pierre Hansen & Brigitte Jaumard & MichèLe Ruiz & Junjie Xiong, 1993. "Global minimization of indefinite quadratic functions subject to box constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 373-392, April.
    3. Marco Locatelli, 2018. "Convex envelopes of bivariate functions through the solution of KKT systems," Journal of Global Optimization, Springer, vol. 72(2), pages 277-303, October.
    4. Ambros M. Gleixner & Timo Berthold & Benjamin Müller & Stefan Weltge, 2017. "Three enhancements for optimization-based bound tightening," Journal of Global Optimization, Springer, vol. 67(4), pages 731-757, April.
    5. Laurence Smith & John Chinneck & Victor Aitken, 2013. "Improved constraint consensus methods for seeking feasibility in nonlinear programs," Computational Optimization and Applications, Springer, vol. 54(3), pages 555-578, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Anatoliy Kuznetsov & Nikolaos V. Sahinidis, 2025. "Simultaneous convexification for the planar obnoxious facility location problem," Journal of Global Optimization, Springer, vol. 92(1), pages 1-20, May.
    2. Brais González-Rodríguez & Joaquín Ossorio-Castillo & Julio González-Díaz & Ángel M. González-Rueda & David R. Penas & Diego Rodríguez-Martínez, 2023. "Computational advances in polynomial optimization: RAPOSa, a freely available global solver," Journal of Global Optimization, Springer, vol. 85(3), pages 541-568, March.
    3. Wei Xia & Juan C. Vera & Luis F. Zuluaga, 2020. "Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 40-56, January.
    4. Jaromił Najman & Dominik Bongartz & Alexander Mitsos, 2021. "Linearization of McCormick relaxations and hybridization with the auxiliary variable method," Journal of Global Optimization, Springer, vol. 80(4), pages 731-756, August.
    5. Felipe Serrano & Robert Schwarz & Ambros Gleixner, 2020. "On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm," Journal of Global Optimization, Springer, vol. 78(1), pages 161-179, September.
    6. Huiyi Cao & Kamil A. Khan, 2023. "General convex relaxations of implicit functions and inverse functions," Journal of Global Optimization, Springer, vol. 86(3), pages 545-572, July.
    7. Alfred Auslender & Miguel A. Goberna & Marco A. López, 2009. "Penalty and Smoothing Methods for Convex Semi-Infinite Programming," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 303-319, May.
    8. Artur M. Schweidtmann & Alexander Mitsos, 2019. "Deterministic Global Optimization with Artificial Neural Networks Embedded," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 925-948, March.
    9. Tapio Westerlund & Ville-Pekka Eronen & Marko M. Mäkelä, 2018. "On solving generalized convex MINLP problems using supporting hyperplane techniques," Journal of Global Optimization, Springer, vol. 71(4), pages 987-1011, August.
    10. Ville-Pekka Eronen & Jan Kronqvist & Tapio Westerlund & Marko M. Mäkelä & Napsu Karmitsa, 2017. "Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems," Journal of Global Optimization, Springer, vol. 69(2), pages 443-459, October.
    11. Samuel Burer & Dieter Vandenbussche, 2009. "Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound," Computational Optimization and Applications, Springer, vol. 43(2), pages 181-195, June.
    12. Valerian Bulatov, 2010. "Methods of embedding-cutting off in problems of mathematical programming," Journal of Global Optimization, Springer, vol. 48(1), pages 3-15, September.
    13. Benjamin Beach & Robert Hildebrand & Joey Huchette, 2022. "Compact mixed-integer programming formulations in quadratic optimization," Journal of Global Optimization, Springer, vol. 84(4), pages 869-912, December.
    14. H. P. Benson, 2010. "Branch-and-Bound Outer Approximation Algorithm for Sum-of-Ratios Fractional Programs," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 1-18, July.
    15. Daniel Dörfler, 2022. "On the Approximation of Unbounded Convex Sets by Polyhedra," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 265-287, July.
    16. Frederic H. Murphy, 1972. "Row Dropping Procedures for Cutting Plane Algorithms," Discussion Papers 16, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    17. Victor Reyes & Ignacio Araya, 2023. "Non-Convex Optimization: Using Preconditioning Matrices for Optimally Improving Variable Bounds in Linear Relaxations," Mathematics, MDPI, vol. 11(16), pages 1-19, August.
    18. Zhou, Yang & Ahn, Soyoung & Wang, Meng & Hoogendoorn, Serge, 2020. "Stabilizing mixed vehicular platoons with connected automated vehicles: An H-infinity approach," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 152-170.
    19. Dan Bienstock & Mauro Escobar & Claudio Gentile & Leo Liberti, 2020. "Mathematical programming formulations for the alternating current optimal power flow problem," 4OR, Springer, vol. 18(3), pages 249-292, September.
    20. Wim Ackooij & Welington Oliveira, 2014. "Level bundle methods for constrained convex optimization with various oracles," Computational Optimization and Applications, Springer, vol. 57(3), pages 555-597, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:91:y:2025:i:2:d:10.1007_s10898-023-01345-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.