References#
Tobias Achterberg. Constraint Integer Programming. PhD thesis, Technische Universität Berlin, 2007. URL: https://depositonce.tu-berlin.de/handle/11303/1747.
Tobias Achterberg, Robert E. Bixby, Zonghao Gu, Edward Rothberg, and Dieter Weninger. Presolve reductions in mixed integer programming. INFORMS Journal on Computing, 32(2):473–506, 2020. doi:10.1287/ijoc.2018.0857.
Tobias Achterberg, Thorsten Koch, and Alexander Martin. Branching rules revisited. Operations Research Letters, 33(1):42–54, 2005. doi:10.1016/j.orl.2004.04.002.
Claire S. Adjiman, Ioannis P. Androulakis, and Christodoulos A. Floudas. A global optimization method, αBB, for general twice-differentiable constrained NLPs — II. Implementation and computational results. Computers & Chemical Engineering, 22(9):1159–1179, 1998. doi:10.1016/S0098-1354(98)00218-X.
Claire S. Adjiman, Silke Dallwig, Christodoulos A. Floudas, and Arnold Neumaier. A global optimization method, αBB, for general twice-differentiable constrained NLPs — I. Theoretical advances. Computers & Chemical Engineering, 22(9):1137–1158, 1998. doi:10.1016/S0098-1354(98)00027-1.
Akshay Agrawal, Brandon Amos, Shane Barratt, Stephen Boyd, Steven Diamond, and J. Zico Kolter. Differentiable convex optimization layers. In Advances in Neural Information Processing Systems 32 (NeurIPS). 2019. URL: https://proceedings.neurips.cc/paper/2019/hash/9ce3c52fc54362e22053399d3181c638-Abstract.html.
Brandon Amos and J. Zico Kolter. OptNet: Differentiable optimization as a layer in neural networks. In Proceedings of the 34th International Conference on Machine Learning (ICML), 136–145. 2017. URL: https://proceedings.mlr.press/v70/amos17a.html.
Ross Anderson, Joey Huchette, Will Ma, Christian Tjandraatmadja, and Juan Pablo Vielma. Strong mixed-integer programming formulations for trained neural networks. In International Conference on Integer Programming and Combinatorial Optimization, 27–42. Springer, 2020. doi:10.1007/978-3-030-45771-6_3.
Ioannis P. Androulakis, Costas D. Maranas, and Christodoulos A. Floudas. αBB: A global optimization method for general constrained nonconvex problems. Journal of Global Optimization, 7(4):337–363, 1995. doi:10.1007/BF01099647.
Anthony Atkinson, Alexander Donev, and Randall Tobias. Optimum Experimental Designs, with SAS. Oxford University Press, 2007.
Charles Audet and J. E. Dennis, Jr. Mesh adaptive direct search algorithms for constrained optimization. SIAM Journal on Optimization, 17(1):188–217, 2006. doi:10.1137/040603371.
Francisco Barahona and Ranga Anbil. The volume algorithm: producing primal solutions with a subgradient method. Mathematical Programming, 87(3):385–399, 2000. doi:10.1007/s101070050002.
Jonathan F. Bard. Practical Bilevel Optimization: Algorithms and Applications. Volume 30 of Nonconvex Optimization and Its Applications. Springer US, 1998. doi:10.1007/978-1-4757-2836-1.
Yonathan Bard. Nonlinear Parameter Estimation. Academic Press, 1974.
E. M. L. Beale and J. A. Tomlin. Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables. In J. Lawrence, editor, Proceedings of the Fifth International Conference on Operational Research, 447–454. London, 1970. Tavistock Publications.
Michael J. Bearpark, Michael A. Robb, and H. Bernhard Schlegel. A direct method for the location of the lowest energy point on a potential surface crossing. Chemical Physics Letters, 223(3):269–274, 1994. doi:10.1016/0009-2614(94)00433-1.
Pietro Belotti, Christian Kirches, Sven Leyffer, Jeff Linderoth, James Luedtke, and Ashutosh Mahajan. Mixed-integer nonlinear optimization. Acta Numerica, 22:1–131, 2013. doi:10.1017/S0962492913000032.
Pietro Belotti, Jon Lee, Leo Liberti, François Margot, and Andreas Wächter. Branching and bounds tightening techniques for non-convex MINLP. Optimization Methods and Software, 24(4–5):597–634, 2009. doi:10.1080/10556780903087124.
Aharon Ben-Tal, Laurent El Ghaoui, and Arkadi Nemirovski. Robust Optimization. Princeton Series in Applied Mathematics. Princeton University Press, 2009. ISBN 978-0-691-14368-2.
Aharon Ben-Tal, Alexander Goryashko, Elana Guslitzer, and Arkadi Nemirovski. Adjustable robust solutions of uncertain linear programs. Mathematical Programming, 99(2):351–376, 2004. doi:10.1007/s10107-003-0454-y.
Aharon Ben-Tal and Arkadi Nemirovski. Robust solutions of uncertain linear programs. Operations Research Letters, 25(1):1–13, 1999. doi:10.1016/S0167-6377(99)00016-4.
Aharon Ben-Tal and Arkadi Nemirovski. Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization. SIAM, 2001. doi:10.1137/1.9780898718829.
Jacques F. Benders. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1):238–252, 1962. doi:10.1007/BF01386316.
Maria Lorena Bergamini, Pio Aguirre, and Ignacio E. Grossmann. Logic-based outer approximation for globally optimal synthesis of process networks. Computers & Chemical Engineering, 29(9):1914–1933, 2005. doi:10.1016/j.compchemeng.2005.04.003.
Timo Berthold. Primal heuristics for mixed integer programs. Master's thesis, Technische Universität Berlin, 2006.
Dimitris Bertsimas and Vineet Goyal. On the power and limitations of affine policies in two-stage adaptive optimization. Mathematical Programming, 134(2):491–531, 2012. doi:10.1007/s10107-011-0444-4.
Dimitris Bertsimas and Melvyn Sim. The price of robustness. Operations Research, 52(1):35–53, 2004. doi:10.1287/opre.1030.0065.
Dimitris Bertsimas and John N. Tsitsiklis. Introduction to Linear Optimization. Athena Scientific, 1997. ISBN 978-1-886529-19-9.
John T. Betts. Practical Methods for Optimal Control and Estimation Using Nonlinear Programming. SIAM, 2nd edition, 2010. ISBN 978-0-89871-688-7. doi:10.1137/1.9780898718577.
Lorenz T. Biegler. Nonlinear Programming: Concepts, Algorithms, and Applications to Chemical Processes. SIAM, 2010. ISBN 978-0-89871-702-0. doi:10.1137/1.9780898719383.
John R. Birge and François Louveaux. Introduction to Stochastic Programming. Springer Series in Operations Research and Financial Engineering. Springer, 2nd edition, 2011. doi:10.1007/978-1-4614-0237-4.
Julian Blank and Kalyanmoy Deb. Pymoo: Multi-objective optimization in Python. IEEE Access, 8:89497–89509, 2020. doi:10.1109/ACCESS.2020.2990567.
Mathieu Blondel, Quentin Berthet, Marco Cuturi, Roy Frostig, Stephan Hoyer, Felipe Llinares-López, Fabian Pedregosa, and Jean-Philippe Vert. Efficient and modular implicit differentiation. Advances in Neural Information Processing Systems, 35:5230–5242, 2022.
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols, Ignacio E. Grossmann, Carl D. Laird, Jon Lee, Andrea Lodi, François Margot, Nicolas Sawaya, and Andreas Wächter. An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization, 5(2):186–204, 2008. doi:10.1016/j.disopt.2006.10.011.
Dominik Bongartz, Jaromił Najman, Susanne Sass, and Alexander Mitsos. MAiNGO – McCormick-based algorithm for mixed-integer nonlinear global optimization. Technical Report, Process Systems Engineering (AVT.SVT), RWTH Aachen University, 2018. URL: http://permalink.avt.rwth-aachen.de/?id=729717.
I. Bongartz, A. R. Conn, N. I. M. Gould, and P. L. Toint. CUTE: constrained and unconstrained testing environment. ACM Transactions on Mathematical Software, 21(1):123–160, 1995. doi:10.1145/200979.201043.
G. E. P. Box and H. L. Lucas. Design of experiments in non-linear situations. Biometrika, 46(1/2):77–90, 1959. doi:10.2307/2332810.
Stephen Boyd, Seung-Jean Kim, Lieven Vandenberghe, and Arash Hassibi. A tutorial on geometric programming. Optimization and Engineering, 8(1):67–127, 2007. doi:10.1007/s11081-007-9001-7.
Stephen Boyd and Lieven Vandenberghe. Convex Optimization. Cambridge University Press, 2004. ISBN 978-0-521-83378-3.
Michael R. Bussieck, Arne Stolbjerg Drud, and Alexander Meeraus. MINLPLib — A collection of test models for mixed-integer nonlinear programming. INFORMS Journal on Computing, 15(1):114–119, 2003. doi:10.1287/ijoc.15.1.114.15159.
J. Carpentier. Contribution à l'étude du dispatching économique. Bulletin de la Société Française des Électriciens, 3(8):431–447, 1962.
Pedro M. Castro. Tightening piecewise McCormick relaxations for bilinear problems. Computers & Chemical Engineering, 72:300–311, 2015. doi:10.1016/j.compchemeng.2014.03.025.
Federico Ceccon, Jordan Jalving, Joshua Haddad, Alexander Thebelt, Calvin Tsay, Carl D. Laird, and Ruth Misener. OMLT: optimization & machine learning toolkit. Journal of Machine Learning Research, 23(349):1–8, 2022.
Federico Ceccon, John D. Siirola, and Ruth Misener. SUSPECT: MINLP special structure detector for Pyomo. TOP, 28(2):579–594, 2020. doi:10.1007/s11750-020-00552-3.
Ricky T. Q. Chen, Yulia Rubanova, Jesse Bettencourt, and David K. Duvenaud. Neural ordinary differential equations. In Advances in Neural Information Processing Systems (NeurIPS), volume 31. 2018.
John W. Chinneck. Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods. Volume 118 of International Series in Operations Research & Management Science. Springer, 2008. doi:10.1007/978-0-387-74932-7.
John W. Chinneck and Erik W. Dravnieks. Locating minimal infeasible constraint sets in linear programs. ORSA Journal on Computing, 3(2):157–168, 1991. doi:10.1287/ijoc.3.2.157.
Carleton Coffrin, Hassan L. Hijazi, and Pascal Van Hentenryck. The QC relaxation: a theoretical and computational study on optimal power flow. IEEE Transactions on Power Systems, 31(4):3008–3018, 2016. doi:10.1109/TPWRS.2015.2463111.
Cyril F. Colebrook. Turbulent flow in pipes, with particular reference to the transition region between the smooth and rough pipe laws. Journal of the Institution of Civil Engineers, 11(4):133–156, 1939. doi:10.1680/ijoti.1939.13150.
Benoît Colson, Patrice Marcotte, and Gilles Savard. An overview of bilevel optimization. Annals of Operations Research, 153(1):235–256, 2007. doi:10.1007/s10479-007-0176-2.
Alberto Costa and Giacomo Nannicini. RBFOpt: an open-source library for black-box optimization with costly function evaluations. Mathematical Programming Computation, 10(4):597–629, 2018. doi:10.1007/s12532-018-0144-7.
Keely L. Croxton, Bernard Gendron, and Thomas L. Magnanti. A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Science, 49(9):1268–1273, 2003. doi:10.1287/mnsc.49.9.1268.16570.
Janet E. Cuthrell and Lorenz T. Biegler. On the optimization of differential-algebraic process systems. AIChE Journal, 33(8):1257–1270, 1987. doi:10.1002/aic.690330804.
R. J. Dakin. A tree-search algorithm for mixed integer programming problems. The Computer Journal, 8(3):250–255, 1965. doi:10.1093/comjnl/8.3.250.
Emilie Danna, Edward Rothberg, and Claude Le Pape. Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming, 102(1):71–90, 2005. doi:10.1007/s10107-004-0518-7.
George B. Dantzig. On the significance of solving linear programming problems with some integer variables. Econometrica, 28(1):30–44, 1960. doi:10.2307/1905292.
George B. Dantzig. Linear Programming and Extensions. Princeton University Press, 1963. ISBN 978-0-691-08000-2.
George B. Dantzig and Philip Wolfe. Decomposition principle for linear programs. Operations Research, 8(1):101–111, 1960. doi:10.1287/opre.8.1.101.
Indraneel Das and J. E. Dennis. Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM Journal on Optimization, 8(3):631–657, 1998. doi:10.1137/S1052623496307510.
Stephan Dempe. Foundations of Bilevel Programming. Kluwer Academic, 2002. doi:10.1007/b101970.
Elizabeth D. Dolan and Jorge J. Moré. Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2):201–213, 2002. doi:10.1007/s101070100263.
Elizabeth D. Dolan and Jorge J. Moré. Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2):201–213, 2002. doi:10.1007/s101070100263.
Richard J. Duffin, Elmor L. Peterson, and Clarence Zener. Geometric Programming: Theory and Application. John Wiley & Sons, New York, 1967.
Iain Dunning, Joey Huchette, and Miles Lubin. JuMP: a modeling language for mathematical optimization. SIAM Review, 59(2):295–320, 2017. doi:10.1137/15M1020575.
Marco A. Duran and Ignacio E. Grossmann. An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming, 36(3):307–339, 1986. doi:10.1007/BF02592064.
Matthias Ehrgott. Multicriteria Optimization. Springer, 2 edition, 2005. doi:10.1007/978-3-662-22199-0.
Adam N. Elmachtoub and Paul Grigas. Smart “Predict, then Optimize”. Management Science, 68(1):9–26, 2022. doi:10.1287/mnsc.2020.3922.
David Eriksson, Michael Pearce, Jacob Gardner, Ryan D. Turner, and Matthias Poloczek. Scalable global optimization via local Bayesian optimization. In Advances in Neural Information Processing Systems 32, 5496–5507. 2019. URL: https://proceedings.neurips.cc/paper/2019/hash/6c990b7aca7bc7058f5e98ea909e924b-Abstract.html.
Ignacio Fdez. Galván and Roland Lindh. Smooth things come in threes: a diabatic surrogate model for conical intersection optimization. Journal of Chemical Theory and Computation, 19(11):3418–3427, 2023. doi:10.1021/acs.jctc.3c00389.
Aaron Ferber, Bryan Wilder, Bistra Dilkina, and Milind Tambe. MIPaaL: mixed integer program as a layer. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, 1504–1511. 2020. doi:10.1609/aaai.v34i02.5509.
Anthony V. Fiacco. Introduction to Sensitivity and Stability Analysis in Nonlinear Programming. Academic Press, 1983. ISBN 978-0-12-254450-7.
Matteo Fischetti, Fred Glover, and Andrea Lodi. The feasibility pump. Mathematical Programming, 104(1):91–104, 2005. doi:10.1007/s10107-004-0570-3.
Matteo Fischetti and Jason Jo. Deep neural networks and mixed integer linear optimization. Constraints, 23:296–309, 2018. doi:10.1007/s10601-018-9285-6.
Matteo Fischetti and Andrea Lodi. Local branching. Mathematical Programming, 98(1–3):23–47, 2003. doi:10.1007/s10107-003-0395-5.
Marshall L. Fisher. The Lagrangian relaxation method for solving integer programming problems. Management Science, 50(12):1861–1871, 2004. doi:10.1287/mnsc.1040.0263.
Roger Fletcher and Sven Leyffer. Solving mixed integer nonlinear programs by outer approximation. Mathematical Programming, 66(1–3):327–349, 1994. doi:10.1007/BF01581153.
H. Scott Fogler. Elements of Chemical Reaction Engineering. Prentice Hall, Boston, 5 edition, 2016.
José Fortuny-Amat and Bruce McCarl. A representation and economic interpretation of a two-level programming problem. Journal of the Operational Research Society, 32(9):783–792, 1981. doi:10.1057/jors.1981.156.
Robert Fourer, David M. Gay, and Brian W. Kernighan. AMPL: A Modeling Language for Mathematical Programming. Brooks/Cole—Thomson Learning, Pacific Grove, CA, 2nd edition, 2003.
Jaroslav M. Fowkes, Lindon Roberts, and Árpád Bürmen. PyCUTEst: an open source Python package of optimization test problems. Journal of Open Source Software, 7(78):4377, 2022. doi:10.21105/joss.04377.
Gaia Franceschini and Sandro Macchietto. Model-based design of experiments for parameter precision: state of the art. Chemical Engineering Science, 63(19):4846–4872, 2008. doi:10.1016/j.ces.2007.11.034.
Arthur M. Geoffrion. Generalized benders decomposition. Journal of Optimization Theory and Applications, 10(4):237–260, 1972. doi:10.1007/BF00934810.
Arthur M. Geoffrion. Lagrangean relaxation for integer programming. Mathematical Programming Studies, 2:82–114, 1974. doi:10.1007/BFb0120690.
S. Gershgorin. Über die Abgrenzung der Eigenwerte einer Matrix. Izv. Akad. Nauk SSSR, Ser. Matem., 6:749–754, 1931.
Ambros M. Gleixner, Timo Berthold, Benjamin Müller, and Stefan Weltge. Three enhancements for optimization-based bound tightening. Journal of Global Optimization, 67(4):731–757, 2017. doi:10.1007/s10898-016-0450-4.
Donald Goldfarb and Ashok Idnani. A numerically stable dual method for solving strictly convex quadratic programs. Mathematical Programming, 27(1):1–33, 1983. doi:10.1007/BF02591962.
Nicholas I. M. Gould, Dominique Orban, and Philippe L. Toint. CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Transactions on Mathematical Software, 29(4):373–394, 2003. doi:10.1145/962437.962439.
Nicholas I. M. Gould, Dominique Orban, and Philippe L. Toint. CUTEst: A constrained and unconstrained testing environment with safe threads for mathematical optimization. Computational Optimization and Applications, 60(3):545–557, 2015. doi:10.1007/s10589-014-9687-3.
Michael Grant, Stephen Boyd, and Yinyu Ye. Disciplined convex programming. In Global Optimization: From Theory to Implementation, 155–210. Springer, 2006. doi:10.1007/0-387-30528-9_7.
Andreas Griewank and Andrea Walther. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. SIAM, 2 edition, 2008. ISBN 978-0-898716-59-7. doi:10.1137/1.9780898717761.
Ignacio E. Grossmann. Review of nonlinear mixed-integer and disjunctive programming techniques. Optimization and Engineering, 3(3):227–252, 2002. doi:10.1023/A:1021039126272.
Ignacio E. Grossmann. Advanced Optimization for Process Systems Engineering. Cambridge University Press, 2021. ISBN 978-1-107-18920-5.
H.-M. Gutmann. A radial basis function method for global optimization. Journal of Global Optimization, 19(3):201–227, 2001. doi:10.1023/A:1011255519438.
William E. Hart, Carl D. Laird, Jean-Paul Watson, David L. Woodruff, Gabriel A. Hackebeil, Bethany L. Nicholson, and John D. Siirola. Pyomo — Optimization Modeling in Python. Volume 67 of Springer Optimization and Its Applications. Springer, second edition, 2017. doi:10.1007/978-3-319-58821-6.
David Hertz. The extreme eigenvalues and stability of real symmetric interval matrices. IEEE Transactions on Automatic Control, 37(4):532–535, 1992. doi:10.1109/9.126593.
Willi Hock and Klaus Schittkowski. Test Examples for Nonlinear Programming Codes. Volume 187 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin, 1981. doi:10.1007/978-3-642-48320-2.
Q. Huangfu and J. A. J. Hall. Parallelizing the dual revised simplex method. Mathematical Programming Computation, 10(1):119–142, 2018. doi:10.1007/s12532-017-0130-5.
D. R. Jones, C. D. Perttunen, and B. E. Stuckman. Lipschitzian optimization without the Lipschitz constant. Journal of Optimization Theory and Applications, 79(1):157–181, 1993. doi:10.1007/BF00941892.
Donald R. Jones and Joaquim R. R. A. Martins. The DIRECT algorithm: 25 years later. Journal of Global Optimization, 79(3):521–566, 2021. doi:10.1007/s10898-020-00952-6.
Donald R. Jones, Matthias Schonlau, and William J. Welch. Efficient global optimization of expensive black-box functions. Journal of Global Optimization, 13(4):455–492, 1998. doi:10.1023/A:1008306431147.
Peter Kall and Stein W. Wallace. Stochastic Programming. John Wiley and Sons, 1994.
George Karypis and Vipin Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359–392, 1998. doi:10.1137/S1064827595287997.
Thomas Kleinert, Martine Labbé, Ivana Ljubić, and Martin Schmidt. A survey on mixed-integer programming techniques in bilevel optimization. EURO Journal on Computational Optimization, 9:100007, 2021. doi:10.1016/j.ejco.2021.100007.
Joshua Knowles. ParEGO: A hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems. IEEE Transactions on Evolutionary Computation, 10(1):50–66, 2006. doi:10.1109/TEVC.2005.851274.
Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, and others. MIPLIB 2010. Springer, 2011. Discusses MIP-start and warm-starting strategies for Branch and Bound solvers. doi:10.1007/s12532-011-0025-9.
Jan Kronqvist, David E. Bernal, and Ignacio E. Grossmann. Using regularization and second order information in outer approximation for convex MINLP. Mathematical Programming, 180:285–310, 2020. doi:10.1007/s10107-018-1356-3.
Jan Kronqvist, David E. Bernal, Andreas Lundell, and Ignacio E. Grossmann. A review and comparison of solvers for convex MINLP. Optimization and Engineering, 20:397–455, 2019. doi:10.1007/s11081-018-9411-8.
Ole Kröger, Carleton Coffrin, Hassan Hijazi, and Harsha Nagarajan. Juniper: an open-source nonlinear branch-and-bound solver in Julia. Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR), pages 377–386, 2018. doi:10.1007/978-3-319-93031-2_27.
Ailsa H. Land and Alison G. Doig. An automatic method of solving discrete programming problems. Econometrica, 28(3):497–520, 1960. doi:10.2307/1910129.
Gilbert Laporte and François V. Louveaux. The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters, 13(3):133–142, 1993. doi:10.1016/0167-6377(93)90002-X.
Sangbum Lee and Ignacio E. Grossmann. New algorithms for nonlinear generalized disjunctive programming. Computers & Chemical Engineering, 24(9–10):2125–2141, 2000. doi:10.1016/S0098-1354(00)00581-0.
Benjamin G. Levine, Joshua D. Coe, and Todd J. Martínez. Optimizing conical intersections without derivative coupling vectors: application to multistate multireference second-order perturbation theory (MS-CASPT2). The Journal of Physical Chemistry B, 112(2):405–413, 2008. doi:10.1021/jp0761618.
Joachim O. Lindner, Karina Sultangaleeva, Merle I. S. Röhr, and Roland Mitrić. metaFALCON: A program package for automatic sampling of conical intersection seams using multistate metadynamics. Journal of Chemical Theory and Computation, 15(6):3450–3460, 2019. doi:10.1021/acs.jctc.9b00029.
Marco Locatelli and Fabio Schoen. Global Optimization: Theory, Algorithms, and Applications. SIAM, 2014. ISBN 978-1-611972-66-5. doi:10.1137/1.9781611972672.
Miles Lubin, Oscar Dowson, Joaquim Dias Garcia, Joey Huchette, Benoît Legat, and Juan Pablo Vielma. JuMP 1.0: recent improvements to a modeling language for mathematical optimization. Mathematical Programming Computation, 15:581–589, 2023. doi:10.1007/s12532-023-00239-3.
Laurens R. Lueg, Victor Alves, Daniel Schicksnus, John R. Kitchin, Carl D. Laird, and Lorenz T. Biegler. A simultaneous approach for training neural differential-algebraic systems of equations. arXiv preprint arXiv:2504.04665, 2025. doi:10.48550/arXiv.2504.04665.
Zhi-Quan Luo, Jong-Shi Pang, and Daniel Ralph. Mathematical Programs with Equilibrium Constraints. Cambridge University Press, 1996. doi:10.1017/CBO9780511983658.
Aleksandr O. Lykhin, Danil S. Kaliakin, Gabriel E. dos Passos, Andrey E. Boguslavskiy, and Sergey A. Varganov. Nonadiabatic transition state theory: application to intersystem crossings in the active sites of metal-sulfur proteins. International Journal of Quantum Chemistry, 116(10):750–761, 2016. doi:10.1002/qua.25124.
Satoshi Maeda, Koichi Ohno, and Keiji Morokuma. Updated branching plane for finding conical intersections without coupling derivative vectors. Journal of Chemical Theory and Computation, 6(5):1538–1545, 2010.
Wai-Kei Mak, David P. Morton, and R. Kevin Wood. Monte carlo bounding techniques for determining solution quality in stochastic programs. Operations Research Letters, 24(1-2):47–56, 1999. doi:10.1016/S0167-6377(98)00054-6.
Jayanta Mandi, Emir Demirović, Peter J. Stuckey, and Tias Guns. Smart predict-and-optimize for hard combinatorial optimization problems. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, 1603–1610. 2020. doi:10.1609/aaai.v34i02.5521.
Costas D. Maranas and Christodoulos A. Floudas. Global optimization in generalized geometric programming. Computers & Chemical Engineering, 21(4):351–369, 1997. doi:10.1016/S0098-1354(96)00282-7.
François Margot. Symmetry in integer linear programming. In 50 Years of Integer Programming 1958–2008, pages 647–686. Springer, 2010. doi:10.1007/978-3-540-68279-0_17.
Harry Markowitz. Portfolio selection. The Journal of Finance, 7(1):77–91, 1952. doi:10.2307/2975974.
Harry M. Markowitz and Alan S. Manne. On the solution of discrete programming problems. Econometrica, 25(1):84–110, 1957. doi:10.2307/1907744.
R. T. Marler and J. S. Arora. Survey of multi-objective optimization methods for engineering. Structural and Multidisciplinary Optimization, 26(6):369–395, 2004. doi:10.1007/s00158-003-0368-6.
João P. Marques-Silva and Karem A. Sakallah. GRASP: a search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5):506–521, 1999. doi:10.1109/12.769433.
George Mavrotas. Effective implementation of the $\varepsilon $-constraint method in multi-objective mathematical programming problems. Applied Mathematics and Computation, 213(2):455–465, 2009. doi:10.1016/j.amc.2009.03.037.
Garth P. McCormick. Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems. Mathematical Programming, 10(1):147–175, 1976. doi:10.1007/BF01580665.
Sanjay Mehrotra. On the implementation of a primal-dual interior point method. SIAM Journal on Optimization, 2(4):575–601, 1992. doi:10.1137/0802028.
A. Messac, A. Ismail-Yahaya, and C. A. Mattson. The normalized normal constraint method for generating the Pareto frontier. Structural and Multidisciplinary Optimization, 25(2):86–98, 2003. doi:10.1007/s00158-002-0276-1.
Kaisa Miettinen. Nonlinear Multiobjective Optimization. Volume 12 of International Series in Operations Research and Management Science. Springer, 1999. doi:10.1007/978-1-4615-5563-6.
Ruth Misener, Jeffrey P. Thompson, and Christodoulos A. Floudas. APOGEE: global optimization of standard, generalized, and extended pooling problems via linear and logarithmic partitioning schemes. Computers & Chemical Engineering, 35(5):876–892, 2011. doi:10.1016/j.compchemeng.2011.01.026.
Alexander Mitsos, Beno\^ıt Chachuat, and Paul I. Barton. McCormick-based relaxations of algorithms. SIAM Journal on Optimization, 20(2):573–601, 2009. doi:10.1137/080717341.
Hans D. Mittelmann. Benchmarking optimization solvers: methodology and results. INFORMS Journal on Computing, 2023. Shifted geometric mean methodology for solver comparisons.
Velibor V. Mišić. Optimization of tree ensembles. Operations Research, 68(5):1605–1624, 2020. doi:10.1287/opre.2019.1928.
Daniel K. Molzahn and Ian A. Hiskens. A survey of relaxations and approximations of the power flow equations. Foundations and Trends in Electric Energy Systems, 4(1–2):1–221, 2019. doi:10.1561/3100000012.
Ramon E. Moore. Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ, 1966.
Bruce A. Murtagh and Michael A. Saunders. MINOS 5.0 User's Guide. Stanford University, Systems Optimization Laboratory, 1983. Describes the MPS input format widely adopted by LP/MILP solvers.
Harsha Nagarajan, Mowen Lu, Site Wang, Russell Bent, and Kaarthik Sundar. An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs. Journal of Global Optimization, 74(4):639–675, 2019. doi:10.1007/s10898-018-00734-1.
Shantanu Naik, Lorenz T. Biegler, Russell Bent, and Robert B. Parker. Variable aggregation for nonlinear optimization problems. arXiv preprint arXiv:2502.13869, 2025. doi:10.48550/arXiv.2502.13869.
George L. Nemhauser and Laurence A. Wolsey. Integer and Combinatorial Optimization. Wiley-Interscience, 1988. ISBN 978-0-471-82819-8.
Arnold Neumaier. Interval Methods for Systems of Equations. Cambridge University Press, 1990. ISBN 978-0-521-33196-8.
Arnold Neumaier and Oleg Shcherbina. Safe bounds in linear and mixed-integer linear programming. Mathematical Programming, 99(2):283–296, 2004. doi:10.1007/s10107-003-0433-3.
Jorge Nocedal and Stephen J. Wright. Numerical Optimization. Springer, 2nd edition, 2006. doi:10.1007/978-0-387-40065-5.
Ding-Yu Peng and Donald B. Robinson. A new two-constant equation of state. Industrial & Engineering Chemistry Fundamentals, 15(1):59–64, 1976. doi:10.1021/i160057a011.
Hans Pirnay, Rodrigo López-Negrete, and Lorenz T. Biegler. Optimal sensitivity based on IPOPT. Mathematical Programming Computation, 4(4):307–331, 2012. doi:10.1007/s12532-012-0043-2.
M. J. D. Powell. An efficient method for finding the minimum of a function of several variables without calculating derivatives. The Computer Journal, 7(2):155–162, 1964. doi:10.1093/comjnl/7.2.155.
Yash Puranik and Nikolaos V. Sahinidis. Domain reduction techniques for global NLP and MINLP optimization. Constraints, 22(3):338–376, 2017. doi:10.1007/s10601-016-9267-5.
Ignacio Quesada and Ignacio E. Grossmann. An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Computers & Chemical Engineering, 16(10–11):937–947, 1992. doi:10.1016/0098-1354(92)80028-8.
Ragheb Rahmaniani, Teodor Gabriel Crainic, Michel Gendreau, and Walter Rei. The Benders decomposition algorithm: a literature review. European Journal of Operational Research, 259(3):801–817, 2017. doi:10.1016/j.ejor.2016.12.005.
Raghunathan Raman and Ignacio E. Grossmann. Modelling and computational techniques for logic based integer programming. Computers & Chemical Engineering, 18(7):563–578, 1994. doi:10.1016/0098-1354(93)E0010-7.
Ramesh Raman and Ignacio E. Grossmann. Modelling and computational techniques for logic based integer programming. Computers & Chemical Engineering, 18(7):563–578, 1994. doi:10.1016/0098-1354(93)E0010-7.
Rommel G. Regis and Christine A. Shoemaker. Constrained global optimization of expensive black box functions using radial basis functions. Journal of Global Optimization, 31(1):153–171, 2005. doi:10.1007/s10898-004-0570-0.
Gareth W. Richings and Scott Habershon. Machine learning seams of conical intersection: a characteristic polynomial approach. The Journal of Physical Chemistry Letters, 2023. doi:10.1021/acs.jpclett.3c01649.
Luis Miguel Rios and Nikolaos V. Sahinidis. Derivative-free optimization: a review of algorithms and comparison of software implementations. Journal of Global Optimization, 56(3):1247–1293, 2013. doi:10.1007/s10898-012-9951-y.
R. Tyrrell Rockafellar and Stanislav Uryasev. Optimization of conditional value-at-risk. Journal of Risk, 2:21–41, 2000. doi:10.21314/JOR.2000.038.
R. Tyrrell Rockafellar and Roger J.-B. Wets. Scenarios and policy aggregation in optimization under uncertainty. Mathematics of Operations Research, 16(1):119–147, 1991. doi:10.1287/moor.16.1.119.
Jiri Rohn. Positive definiteness and stability of interval matrices. SIAM Journal on Matrix Analysis and Applications, 15(1):175–184, 1994. doi:10.1137/S0895479891219216.
Daniel Ruiz. A scaling algorithm to equilibrate both rows and columns norms in matrices. Technical Report RAL-TR-2001-034, Rutherford Appleton Laboratory, Chilton, Oxfordshire, UK, 2001.
Hong S. Ryoo and Nikolaos V. Sahinidis. A branch-and-reduce approach to global optimization. Journal of Global Optimization, 8(2):107–138, 1996. doi:10.1007/BF00138689.
Jerome Sacks, William J. Welch, Toby J. Mitchell, and Henry P. Wynn. Design and analysis of computer experiments. Statistical Science, 4(4):409–423, 1989. doi:10.1214/ss/1177012413.
Martin W. P. Savelsbergh. Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing, 6(4):445–454, 1994. doi:10.1287/ijoc.6.4.445.
Nicolas W. Sawaya and Ignacio E. Grossmann. A cutting plane method for solving linear generalized disjunctive programming problems. Computers & Chemical Engineering, 29(9):1891–1913, 2005. doi:10.1016/j.compchemeng.2005.04.004.
Stefan Scholtes. Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM Journal on Optimization, 11(4):918–936, 2001. doi:10.1137/S1052623499361233.
Artur M. Schweidtmann and Alexander Mitsos. Deterministic global optimization with artificial neural networks embedded. Journal of Optimization Theory and Applications, 180(3):925–948, 2019. doi:10.1007/s10957-018-1396-0.
Thiago Serra, Christian Tjandraatmadja, and Srikumar Ramalingam. Bounding and counting linear regions of deep neural networks. In Proceedings of the 35th International Conference on Machine Learning (ICML), volume 80 of Proceedings of Machine Learning Research, 4558–4566. 2018.
Alexander Shapiro, Darinka Dentcheva, and Andrzej Ruszczyński. Lectures on Stochastic Programming: Modeling and Theory. MOS-SIAM Series on Optimization. SIAM, 3rd edition, 2021. doi:10.1137/1.9781611976595.
Hanif D. Sherali and Warren P. Adams. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics, 3(3):411–430, 1990. doi:10.1137/0403036.
E. M. B. Smith and C. C. Pantelides. A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Computers & Chemical Engineering, 23(4–5):457–478, 1999. doi:10.1016/S0098-1354(98)00286-5.
Ralph E. Steuer and Eng-Ung Choo. An interactive weighted Tchebycheff procedure for multiple objective programming. Mathematical Programming, 26(3):326–344, 1983. doi:10.1007/BF02591870.
Linas Stripinis, Remigijus Paulavičius, and Julius Žilinskas. Penalty functions and two-step selection procedure based DIRECT-type method for constrained global optimization. Structural and Multidisciplinary Optimization, 59(6):2155–2175, 2019. doi:10.1007/s00158-018-2181-2.
Mohit Tawarmalani and Nikolaos V. Sahinidis. A polyhedral branch-and-cut approach to global optimization. Mathematical Programming, 103(2):225–249, 2005. doi:10.1007/s10107-005-0581-8.
Vincent Tjeng, Kai Y. Xiao, and Russ Tedrake. Evaluating robustness of neural networks with mixed integer programming. In International Conference on Learning Representations (ICLR). 2019.
Francisco Trespalacios and Ignacio E. Grossmann. Improved Big-M reformulation for generalized disjunctive programs. Computers & Chemical Engineering, 76:98–103, 2015. doi:10.1016/j.compchemeng.2015.02.013.
Angelos Tsoukalas and Alexander Mitsos. Multivariate McCormick relaxations. Journal of Global Optimization, 59(2–3):633–662, 2014. doi:10.1007/s10898-014-0176-0.
Metin Türkay and Ignacio E. Grossmann. Logic-based MINLP algorithms for the optimal synthesis of process networks. Computers & Chemical Engineering, 20(8):959–978, 1996. doi:10.1016/0098-1354(95)00219-7.
Richard M. Van Slyke and Roger J.-B. Wets. L-shaped linear programs with applications to optimal control and stochastic programming. SIAM Journal on Applied Mathematics, 17(4):638–663, 1969. doi:10.1137/0117061.
Juan Pablo Vielma. Mixed integer linear programming formulation techniques. SIAM Review, 57(1):3–57, 2015. doi:10.1137/130915303.
Juan Pablo Vielma, Shabbir Ahmed, and George Nemhauser. Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions. Operations Research, 58(2):303–315, 2010. doi:10.1287/opre.1090.0721.
Juan Pablo Vielma and George L. Nemhauser. Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Mathematical Programming, 128(1–2):49–72, 2011. doi:10.1007/s10107-009-0295-4.
J. Viswanathan and Ignacio E. Grossmann. A combined penalty function and outer-approximation method for MINLP optimization. Computers & Chemical Engineering, 14(7):769–782, 1990. doi:10.1016/0098-1354(90)87085-4.
David C. Walters and Gerald B. Sheble. Genetic algorithm solution of economic dispatch with valve point loading. IEEE Transactions on Power Systems, 8(3):1325–1332, 1993. doi:10.1109/59.260861.
Tapio Westerlund and Frank Pettersson. An extended cutting plane method for solving convex MINLP problems. Computers & Chemical Engineering, 19:S131–S136, 1995. doi:10.1016/0098-1354(95)00164-W.
Bryan Wilder, Bistra Dilkina, and Milind Tambe. Melding the data-decisions pipeline: Decision-focused learning for combinatorial optimization. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 33, 1658–1665. 2019. doi:10.1609/aaai.v33i01.33011658.
Mark D. Wilkinson, Michel Dumontier, IJsbrand Jan Aalbersberg, Gabrielle Appleton, Myles Axton, Arie Baak, Niklas Blomberg, Jan-Willem Boiten, Luiz Bonino da Silva Santos, Philip E. Bourne, and others. The FAIR guiding principles for scientific data management and stewardship. Scientific Data, 3:160018, 2016. doi:10.1038/sdata.2016.18.
H. Paul Williams. Model Building in Mathematical Programming. Wiley, 5 edition, 2013. ISBN 978-1-118-44333-0.
Laurence A. Wolsey. Integer Programming. Wiley-Interscience, 1998. ISBN 978-0-471-28366-9.
Stephen J. Wright. Primal-Dual Interior-Point Methods. SIAM, 1997. ISBN 978-0-89871-382-4.
Andreas Wächter and Lorenz T. Biegler. On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Mathematical Programming, 106(1):25–57, 2006. doi:10.1007/s10107-004-0559-y.
Kai Y. Xiao, Vincent Tjeng, Nur Muhammad (Mahi) Shafiullah, and Aleksander Madry. Training for faster adversarial robustness verification via inducing ReLU stability. In International Conference on Learning Representations (ICLR). 2019.
David R. Yarkony. Systematic determination of intersections of potential energy surfaces using a Lagrange multiplier constrained procedure. The Journal of Physical Chemistry, 97(17):4407–4412, 1993. doi:10.1021/j100119a026.
Eckart Zitzler, Kalyanmoy Deb, and Lothar Thiele. Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation, 8(2):173–195, 2000. doi:10.1162/106365600568202.
IBM. IBM ILOG CPLEX Optimization Studio Documentation. 2022. Defines the CPLEX LP file format specification. URL: https://www.ibm.com/docs/en/icos.
International Organization for Standardization. ISO 80000-2:2019 quantities and units — part 2: mathematics. Technical Report, International Organization for Standardization, Geneva, 2019.