References#
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.
Hirotugu Akaike. Information theory and an extension of the maximum likelihood principle. In 2nd International Symposium on Information Theory, 267–281. 1973.
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.
Steven P. Asprey and Sandro Macchietto. Designing robust optimal dynamic experiments. Journal of Process Control, 12(4):545–556, 2002. doi:10.1016/S0959-1524(01)00020-8.
Anthony Atkinson, Alexander Donev, and Randall Tobias. Optimum Experimental Designs, with SAS. Oxford University Press, 2007.
Anthony C. Atkinson, Barbara Bogacka, and Marek B. Bogacki. D- and T-optimum designs for the kinetics of a reversible chemical reaction. Chemometrics and Intelligent Laboratory Systems, 43(1–2):185–198, 1998. doi:10.1016/S0169-7439(98)00104-7.
Yonathan Bard. Nonlinear Parameter Estimation. Academic Press, 1974.
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.
David A. Belsley, Edwin Kuh, and Roy E. Welsch. Regression Diagnostics: Identifying Influential Data and Sources of Collinearity. Wiley, 1980. ISBN 0-471-05856-4.
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.
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.
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.
Julian Blank and Kalyanmoy Deb. Pymoo: Multi-objective optimization in Python. IEEE Access, 8:89497–89509, 2020. doi:10.1109/ACCESS.2020.2990567.
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.
George E. P. Box, J. Stuart Hunter, and William G. Hunter. Statistics for Experimenters: Design, Innovation, and Discovery. Wiley-Interscience, 2nd edition, 2005.
George E. P. Box and Kenneth B. Wilson. On the experimental attainment of optimum conditions. Journal of the Royal Statistical Society, Series B, 13(1):1–45, 1951.
Stephen Boyd and Lieven Vandenberghe. Convex Optimization. Cambridge University Press, 2004. ISBN 978-0-521-83378-3.
Roland Brun, Peter Reichert, and Hans R. Künsch. Practical identifiability analysis of large environmental simulation models. Water Resources Research, 37(4):1015–1030, 2001. doi:10.1029/2000WR900350.
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.
Guido Buzzi-Ferraris, Pio Forzatti, Gerhard Emig, and Hartmut Hofmann. Sequential experimental design for model discrimination in the case of multiple responses. Chemical Engineering Science, 39(1):81–85, 1984. doi:10.1016/0009-2509(84)80132-3.
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.
Yunfei Chu and Juergen Hahn. Parameter set selection for estimation of nonlinear dynamic systems. AIChE Journal, 53(11):2858–2870, 2007. doi:10.1002/aic.11295.
Yunfei Chu and Juergen Hahn. Generalization of a parameter set selection procedure based on orthogonal projections and the D-optimality criterion. AIChE Journal, 58(7):2085–2096, 2012. doi:10.1002/aic.12727.
William G. Cochran and Gertrude M. Cox. Experimental Designs. Wiley, New York, 2nd edition, 1957.
John A. Cornell. Experiments with Mixtures: Designs, Models, and the Analysis of Mixture Data. Wiley, 3rd edition, 2002.
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.
George B. Dantzig. Linear Programming and Extensions. Princeton University Press, 1963. ISBN 978-0-691-08000-2.
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.
Elizabeth D. Dolan and Jorge J. Moré. Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2):201–213, 2002. doi:10.1007/s101070100263.
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.
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.
Ronald A. Fisher. The Design of Experiments. Oliver and Boyd, Edinburgh, 1935.
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.
Adam Foster, Martin Jankowiak, Eli Bingham, Paul Horsfall, Yee Whye Teh, Tom Rainforth, and Noah Goodman. Variational Bayesian optimal experimental design. In Advances in Neural Information Processing Systems 32. 2019.
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.
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.
Federico Galvanin, Massimiliano Barolo, and Fabrizio Bezzo. Online model-based redesign of experiments for parameter estimation in dynamic systems. Industrial & Engineering Chemistry Research, 48(9):4415–4427, 2009. doi:10.1021/ie8018356.
Federico Galvanin, Sandro Macchietto, and Fabrizio Bezzo. Model-based design of parallel experiments. Industrial & Engineering Chemistry Research, 46(3):871–882, 2007. doi:10.1021/ie0611406.
Maxime Gasse, Didier Chételat, Nicola Ferroni, Laurent Charlin, and Andrea Lodi. Exact combinatorial optimization with graph convolutional neural networks. In Advances in Neural Information Processing Systems 32 (NeurIPS). 2019. URL: https://proceedings.neurips.cc/paper/2019/hash/d14c2267d848abeb81fd590f371d39bd-Abstract.html.
Marco Geremia, Sandro Macchietto, and Fabrizio Bezzo. A review on model-based design of experiments for parameter precision: open challenges, trends and future perspectives. Chemical Engineering Science, 319:122347, 2026.
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.
Leonardo D. González and Victor M. Zavala. New paradigms for exploiting parallel experiments in Bayesian optimization. Computers & Chemical Engineering, 170:108110, 2023. doi:10.1016/j.compchemeng.2022.108110.
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. Advanced Optimization for Process Systems Engineering. Cambridge University Press, 2021. ISBN 978-1-107-18920-5.
Ryan N. Gutenkunst, Joshua J. Waterfall, Fergal P. Casey, Kevin S. Brown, Christopher R. Myers, and James P. Sethna. Universally sloppy parameter sensitivities in systems biology models. PLoS Computational Biology, 3(10):e189, 2007. doi:10.1371/journal.pcbi.0030189.
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.
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.
William G. Hunter and Anthony M. Reiner. Designs for discriminating between two rival models. Technometrics, 7(3):307–323, 1965. doi:10.1080/00401706.1965.10490265.
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.
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.
Clemens Kreutz, Andreas Raue, Daniel Kaschek, and Jens Timmer. Profile likelihood in systems biology. FEBS Journal, 280(11):2564–2571, 2013. doi:10.1111/febs.12276.
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.
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.
Dennis V. Lindley. On a measure of the information provided by an experiment. Annals of Mathematical Statistics, 27(4):986–1005, 1956. doi:10.1214/aoms/1177728069.
Marco Locatelli and Fabio Schoen. Global Optimization: Theory, Algorithms, and Applications. SIAM, 2014. ISBN 978-1-611972-66-5. doi:10.1137/1.9781611972672.
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.
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.
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.
Hongyu Miao, Xiaohua Xia, Alan S. Perelson, and Hulin Wu. On identifiability of nonlinear ode models and applications in viral dynamics. SIAM Review, 53(1):3–39, 2011. Canonical review of structural and practical identifiability. doi:10.1137/090757009.
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.
Hans D. Mittelmann. Benchmarking optimization solvers: methodology and results. INFORMS Journal on Computing, 2023. Shifted geometric mean methodology for solver comparisons.
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.
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.
Jorge Nocedal and Stephen J. Wright. Numerical Optimization. Springer, 2nd edition, 2006. doi:10.1007/978-0-387-40065-5.
Simon Olofsson, Marc P. Deisenroth, and Ruth Misener. GPdoemd: a Python package for design of experiments for model discrimination. Computers & Chemical Engineering, 125:54–70, 2019. doi:10.1016/j.compchemeng.2019.03.010.
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.
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.
Tom Rainforth, Adam Foster, Desi R. Ivanova, and Freddie Bickford Smith. Modern Bayesian experimental design. Statistical Science, 2024. arXiv:2302.14545.
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.
Carl Edward Rasmussen and Christopher K. I. Williams. Gaussian Processes for Machine Learning. MIT Press, Cambridge, MA, 2006.
A. Raue, C. Kreutz, T. Maiwald, J. Bachmann, M. Schilling, U. Klingmüller, and J. Timmer. Structural and practical identifiability analysis of partially observed dynamical models by exploiting the profile likelihood. Bioinformatics, 25(15):1923–1929, 2009. doi:10.1093/bioinformatics/btp358.
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.
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.
Marco Sandrin, Constantinos C. Pantelides, and Beno\^ıt Chachuat. Methodological and computational framework for model-based design of parallel experiment campaigns under uncertainty. Journal of Process Control, 152:103465, 2025. doi:10.1016/j.jprocont.2025.103465.
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.
Henry Scheffé. Experiments with mixtures. Journal of the Royal Statistical Society. Series B (Methodological), 20(2):344–360, 1958.
Henry Scheffé. The simplex-centroid design for experiments with mixtures. Journal of the Royal Statistical Society. Series B (Methodological), 25(2):235–263, 1963.
Gideon Schwarz. Estimating the dimension of a model. Annals of Statistics, 6(2):461–464, 1978. doi:10.1214/aos/1176344136.
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.
Jasper Snoek, Hugo Larochelle, and Ryan P. Adams. Practical Bayesian optimization of machine learning algorithms. In Advances in Neural Information Processing Systems 25, 2951–2959. 2012.
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.
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.
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.
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.
Alejandro F. Villaverde. Observability and structural identifiability of nonlinear biological systems. Complexity, 2019:8497093, 2019. Tutorial survey of structural identifiability from the differential-geometric viewpoint. doi:10.1155/2019/8497093.
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.
Quang H. Vuong. Likelihood ratio tests for model selection and non-nested hypotheses. Econometrica, 57(2):307–333, 1989. doi:10.2307/1912557.
Jialu Wang and Alexander W. Dowling. Pyomo.DOE: an open-source package for model-based design of experiments in Python. AIChE Journal, 68(12):e17813, 2022. doi:10.1002/aic.17813.
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.
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.
Kunhao Z. Yao, Beth M. Shaw, Bing Kou, Kimberley B. McAuley, and D. W. Bacon. Modeling ethylene/butene copolymerization with multisite catalysts: parameter estimability and experimental design. Polymer Reaction Engineering, 11(3):563–588, 2003. doi:10.1081/PRE-120024426.
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.