Bibliography
[1]

K. Abhishek, S. Leyffer, and J. T. Linderoth. FilMINT: An outer-approximation-based solver for nonlinear mixed integer programs. INFORMS Journal On Computing, 22(4):555–567, 2010.

[2]

T. Achterberg, T. Koch, and A. Martin. Branching rules revisited. Operations Research Letters, 33(1):42–54, 2005.

[3]

T. Achterberg, T. Berthold, T. Koch, and K. Wolter. Constraint integer programming: A new approach to integrate CP and MIP. In L. Perron and M.A. Trick, editors, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 5th International Conference, CPAIOR 2008, volume 5015 of LNCS, pages 6–20. Springer, 2008.

[4]

T. Achterberg. Constraint Integer Programming. PhD thesis, Technische Universität Berlin, 2007.

[5]

T. Achterberg. SCIP: Solving Constraint Integer Programs. Mathematical Programming Computations, 1(1):1–41, 2009.

[6]

N. Adhya, M. Tawarmalani, and N. V. Sahinidis. A Lagrangian approach to the pooling problem. Industrial & Engineering Chemistry Research, 38(5):1965–1972, 1999.

[7]

C. S. Adjiman, I. P. Androulakis, and C. A. Floudas. A global optimization method, αBB, for general twice differentiable NLPs – II. Implementation and computational results. Computers & Chemical Engineering, 22(9):1159–1179, 1998.

[8]

C. S. Adjiman, S. Dallwig, C. A. Floudas, and A. Neumaier. A global optimization method, αBB, for general twice differentiable NLPs – I. Theoretical advances. Computers & Chemical Engineering, 22(9):1137–1158, 1998.

[9]

A. Aggarwal and C. A. Floudas. Synthesis of general distillation sequences – nonsharp separations. Computers & Chemical Engineering, 14(6):631–653, 1990.

[10]

S. Ahmed, M. Tawarmalani, and N. V. Sahinidis. A finite branch-and-bound algorithm for two-stage stochastic integer programs. Mathematical Programming, 100(2):355–377, 2004.

[11]

E. Ahmetovic and I. E. Grossmann. Global superstructure optimization for the design of integrated process water networks. AIChE Journal, 57(2):434–457, 2011.

[12]

H. Almutairi and S. Elhedhli. A new Lagrangean approach to the pooling problem. Journal of Global Optimization, 45(2):237–257, 2009.

[13]

A. Alva-Argáez, A. C. Kokossis, and R. Smith. Wastewater minimisation of industrial systems using an integrated approach. Computers & Chemical Engineering, 22(suppl.):S741–S744, 1998.

[14]

P. R. Amestoy, I. S. Duff, J. Koster, and J.-Y. L'Excellent. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM Journal of Matrix Analysis and Applications, 23(1):15–24, 2001.

[15]

P. R. Amestoy, A. Guermouche, J.-Y. L'Excellent, and S. Pralet. Hybrid scheduling for the parallel solution of linear systems. Parallel Computing, 32(2):136–156, 2006.

[16]

I. P. Androulakis, C. D. Maranas, and C. A. Floudas. αBB: A global optimization method for general constrained nonconvex problems. Journal of Global Optimization, 7(4):337–363, 1995.

[17]

K. M. Anstreicher. Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. Journal of Global Optimization, 43(2-3):471–484, 2009.

[18]

C. Audet, P. Hansen, B. Jaumard, and G. Savard. A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Mathematical Programming, 87(1):131–152, 2000.

[19]

C. Audet, P. Hansen, F. Messine, and J. Xiong. The largest small octagon. Journal of Combinatorial Theory, Series A, 98(1):46–59, 2002.

[20]

C. Audet, J. Brimberg, P. Hansen, S. Le Digabel, and N. Mladenovic. Pooling problem: Alternate formulations and solution methods. Management Science, 50(6):761–776, 2004.

[21]

C. Audet, P. Hansen, and F. Messine. The small octagon with longest perimeter. Journal of Combinatorial Theory, Series A, 114(1):135–150, 2007.

[22]

M. Bagajewicz. A review of recent design procedures for water networks in refineries and process plants. Computers & Chemical Engineering, 24(9-10):2093–2113, 2000.

[23]

R. C. Baliban, J. A. Elia, and C. A. Floudas. Toward novel hybrid biomass, coal, and natural gas processes for satisfying current transportation fuel demands – 1. process alternatives, gasification modeling, process simulation, and economic analysis. Industrial & Engineering Chemistry Research, 49(16):7343–7370, 2010.

[24]

R. C. Baliban, J. A. Elia, and C. A. Floudas. Optimization framework for the simultaneous process synthesis, heat and power integration of a thermochemical hybrid biomass, coal, and natural gas facility. Computers & Chemical Engineering, 35(9):1647–1690, 2011.

[25]

X. Bao, N. V. Sahinidis, and M. Tawarmalani. Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs. Optimization Methods and Software, 24(4-5):485–504, 2009.

[26]

X. Bao, N. V. Sahinidis, and M. Tawarmalani. Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons. Mathematical Programming, 129(1):129–157, 2011.

[27]

X. Bao, A. Khajavirad, N. V. Sahinidis, and M. Tawarmalani. Global optimization of nonconvex problems with multilinear intermediates. Mathematical Programming Computation, 7(1):1–37, 2015.

[28]

J. F. Bard. Practical bilevel optimization: Algorithms and applications, volume 30 of Nonconvex optimization and its applications. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998.

[29]

R. H. Bartels and G. H. Golub. The simplex method of linear programming using the LU decomposition. Communications of the ACM, 12(5):266–268, 1969.

[30]

R. H. Bartels. A stabilization of the simplex method. Numerische Mathematik, 16(5):414–434, 1971.

[31]

P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wächter. Branching and bounds tightening techniques for non-convex MINLP. Optimization Methods and Software, 24(4–5):597–634, 2009.

[32]

P. Belotti. COUENNE: a user's manual, 2010.

[33]

P. Belotti. Disjunctive cuts for non-convex MINLP. In Lee and Leyffer [LeLe12], pages 117–144.

[34]

A. Ben-Tal, G. Eiger, and V. Gershovitz. Global minimization by reducing the duality gap. Mathematical Programming, 63(1-3):193–212, 1994.

[35]

M. L. Bergamini, I. Grossmann, N. Scenna, and P. Aguirre. An improved piecewise outer-approximation algorithm for the global optimization of MINLP models involving concave and bilinear terms. Computers & Chemical Engineering, 32(3):477–493, 2008.

[36]

D. E. Bernal, S. Vigerske, F. Trespalacios, and I. E. Grossmann. Improving the performance of DICOPT in convex MINLP problems using a feasibility pump, 2017.

[37]

T. Berthold, S. Heinz, and S. Vigerske. Extending a CIP framework to solve MIQCPs. In Lee and Leyffer [LeLe12], pages 427–444.

[38]

T. Berthold. Heuristic algorithms in global MINLP solvers. PhD thesis, TU Berlin, 2014.

[39]

L. T. Biegler. Nonlinear Programming: Concepts, Algorithms and Applications to Chemical Processes. MOS-SIAM Series on Optimization. SIAM, Philadelphia, 2010.

[40]

S. C. Billups and M. C. Ferris. QPCOMP: A quadratic program based solver for mixed complementarity problems. Mathematical Programming, 76(3):533–562, 1997.

[41]

S. C. Billups. Algorithms for Complementarity Problems and Generalized Equations. PhD thesis, University of Wisconsin–Madison, Madison, Wisconsin, 1995.

[42]

S. C. Billups. Improving the robustness of descent-based methods for semismooth equations using proximal perturbations. Mathematical Programming, 87(1):153–175, 2000.

[43]

A. Bompadre and A. Mitsos. Convergence rate of McCormick relaxations. Journal of Global Optimization, 52(1):1–28, 2011.

[44]

P. Bonami and J. P. M. Gonçalves. Heuristics for convex mixed integer nonlinear programs. Computational Optimization and Applications, 51(2):729–747, 2012.

[45]

P. Bonami and J. Lee. BONMIN Users' Manual, 1.5 edition, 2011.

[46]

P. Bonami, A. Wächter, L. T. Biegler, A. R. Conn, G. Cornuéjols, I. E. Grossmann, C. D. Laird, J. Lee, A. Lodi, F. Margot, and N. W. Sawaya. An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization, 5(2):186–204, 2008.

[47]

P. Bonami, G. Cornuéjols, A. Lodi, and F. Margot. A feasibility pump for mixed integer nonlinear programs. Mathematical Programming, 119(2):331–352, 2009.

[48]

P. Bonami, M. Kilinç, and J. Linderoth. Algorithms and software for convex mixed integer nonlinear programs. In Lee and Leyffer [LeLe12], pages 1–40.

[49]

J. Bracken and J. T. McGill. Mathematical programs with optimization problems in the constraints. Operations Research, 21(1):37–44, 1973.

[50]

R. H. Byrd, M. E. Hribar, and J. Nocedal. An interior point algorithm for large scale nonlinear programming. SIAM Journal on Optimization, 9(4):877–900, 1999.

[51]

R. H. Byrd, J. C. Gilbert, and J. Nocedal. A trust region method based on interior point techniques for nonlinear programming. Mathematical Programming, 89(1):149–185, 2000.

[52]

R. H. Byrd, J. Nocedal, and R. A. Waltz. Feasible interior methods using slacks for nonlinear optimization. Computational Optimization and Applications, 26(1):35–61, 2003.

[53]

R. H. Byrd, N. I. M. Gould, J. Nocedal, and R. A. Waltz. An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. Mathematical Programming, Series B, 100(1):27–48, 2004.

[54]

R. H. Byrd, N. I. M. Gould, J. Nocedal, and R. A. Waltz. On the convergence of successive linear-quadratic programming algorithms. SIAM Journal on Optimization, 16(2):471–489, 2005.

[55]

R. M. Chamberlain, M. J. D. Powell, and C. Lemaréchal. The watchdog technique for forcing convergence in algorithms for constrained optimization, volume 16 of Mathematical Programming Studies, pages 1–17. Springer, Berlin, Heidelberg, 1982.

[56]

Y. Chang and N. V. Sahinidis. Global optimization in stabilizing controller design. Journal of Global Optimization, 38(4):509–526, 2007.

[57]

V. Chvátal. Linear Programming. W. H. Freeman and Compan, New York, 1983.

[58]

A. R. Ciric and C. A. Floudas. A retrofit approach for heat exchanger networks. Computers & Chemical Engineering, 13(6):703–715, 1989.

[59]

A. R. Conn. Constrained optimization using a nondifferentiable penalty function. SIAM Journal on Numerical Analysis, 10(4):760–784, 1973.

[60]

A. Costa, P. Hansen, and L. Liberti. On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square. Discrete Applied Mathematics, 161(1–2):96–106, 2013.

[61]

R. W. Cottle and G. B. Dantzig. Complementary pivot theory of mathematical programming. Linear Algebra and its Applications, 1(1):103–125, 1968.

[62]

R. W. Cottle, J. S. Pang, and R. E. Stone. The Linear Complementarity Problem. Academic Press, Boston, 1992.

[63]

G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, New Jersey, 1963.

[64]

S. Devarajan, J. D. Lewis, and S. Robinson. Policy lessons from trade-focused, two-sector models. Journal of Policy Modeling, 12(4):625–657, 1990.

[65]

Paul Dierckx. Curve and Surface Fitting with Splines. Oxford University Press, 1993.

[66]

S. P. Dirkse and M. C. Ferris. MCPLIB: a collection of nonlinear mixed complementarity problems. Optimization Methods and Software, 5(4):319–345, 1995.

[67]

S. P. Dirkse and M. C. Ferris. A path search damped Newton method for computing general equilibria. Annals of Operations Research, 68(2):211–232, 1996.

[68]

S. P. Dirkse and M. C. Ferris. Crash techniques for large-scale complementarity problems. In M. C. Ferris and J. S. Pang, editors, Complementarity and Variational Problems: State of the Art, pages 40–61. SIAM Publications, 1997.

[69]

S. P. Dirkse and M. C. Ferris. Traffic modeling and variational inequalities using GAMS. In K. Tanczos Ph. L. Toint, M. Labbe and G. Laporte, editors, Operations Research and Decision Aid Methodologies in Traffic and Transportation Management, volume 166, pages 136–163. NATO ASI Series F, Philadelphia, Pennsylvania, 1998.

[70]

S. P. Dirkse. Robust Solution of Mixed Complementarity Problems. PhD thesis, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, 1994.

[71]

F. Domes and A. Neumaier. Constraint propagation on quadratic constraints. Constraints, 15(3):404–429, 2010.

[72]

F. Domes and A. Neumaier. Rigorous enclosures of ellipsoids and directed cholesky factorizations. SIAM Journal on Matrix Analysis and Applications, 32(1):262–285, 2011.

[73]

M. C. Dorneich and N. V. Sahinidis. Global optimization algorithms for chip layout and compaction. Engineering Optimization, 25(2):131–154, 1995.

[74]

Marco A. Duran and Ignacio E. Grossmann. A mixed-integer nonlinear programming algorithm for process systems synthesis. AIChE Journal, 32(4):592–606, 1986.

[75]

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.

[76]

S. K. Eldersveld. Large-scale sequential quadratic programming algorithms. PhD thesis, Department of Operations Research, Stanford University, Stanford, CA, 1991.

[77]

J. A. Elia, R. C. Baliban, and C. A. Floudas. Toward novel hybrid biomass, coal, and natural gas processes for satisfying current transportation fuel demands – 2. simultaneous heat and power integration. Industrial & Engineering Chemistry Research, 49(16):7371–7388, 2010.

[78]

R. Ericson and A. Pakes. Markov perfect industry dynamics: A framework for empirical analysis. The Review of Economic Studies, 62(1):53–82, 1995.

[79]

D. C. Faria and M. J. Bagajewicz. On the appropriate modeling of process plant water systems. AIChE Journal, 56(3):668–689, 2010.

[80]

M. C. Ferris and S. Lucidi. Nonmonotone stabilization methods for nonlinear equations. Journal of Optimization Theory and Applications, 81(1):53–71, 1994.

[81]

M. C. Ferris and T. S. Munson. Interfaces to PATH 3.0: Design, implementation and usage. Computational Optimization and Applications, 12(1-3):207–227, 1999.

[82]

M. C. Ferris and T. S. Munson. Preprocessing complementarity problems. In Michael C. Ferris, Olvi L. Mangasarian, and Jong-Shi Pang, editors, Complementarity: Applications, Algorithms and Extensions, pages 143–164. Springer US, Boston, MA, 2001.

[83]

M. C. Ferris and J. S. Pang, editors. Complementarity and Variational Problems: State of the Art. SIAM Publications, Philadelphia, Pennsylvania, 1997.

[84]

M. C. Ferris and J. S. Pang. Engineering and economic applications of complementarity problems. SIAM Review, 39(4):669–713, 1997.

[85]

M. C. Ferris, C. Kanzow, and T. S. Munson. Feasible descent algorithms for mixed complementarity problems. Mathematical Programming, 86(3):475–497, 1999.

[86]

M. C. Ferris, A. Meeraus, and T. F. Rutherford. Computing Wardropian equilibria in a complementarity framework. Optimization Methods and Software, 10(5):669–685, 1999.

[87]

A. Fischer. A special Newton–type optimization method. Optimization, 24(3-4):269–284, 1992.

[88]

Roger Fletcher and Sven Leyffer. Solving mixed integer nonlinear programs by outer approximation. Mathematical Programming, 66(1-3):327–349, 1994.

[89]

R. Fletcher. An ell 1 penalty method for nonlinear constraints. In P. T. Boggs, R. H. Byrd, and R. B. Schnabel, editors, Numerical Optimization 1984, pages 26–40, Philadelphia, 1985. SIAM.

[90]

C. A. Floudas and A. Aggarwal. A decomposition strategy for global optimum search in the pooling problem. ORSA Journal on Computing, 2(3):225–235, 1990.

[91]

C. A. Floudas and S. H. Anastasiadis. Synthesis of distillation sequences with several multicomponent feed and product streams. Chemical Engineering Science, 43(9):2407–2419, 1988.

[92]

C. A. Floudas and C. E. Gounaris. A review of recent advances in global optimization. Journal of Global Optimization, 45(1):3–38, 2009.

[93]

C. A. Floudas and I. E. Grossmann. Synthesis of flexible heat-exchanger networks with uncertain flowrates and temperatures. Computers & Chemical Engineering, 11(4):319–336, 1987.

[94]

C. A. Floudas and G. E. Paules. A mixed-integer nonlinear programming formulation for the synthesis of heat-integrated distillation sequences. Computers & Chemical Engineering, 12(6):531–546, 1988.

[95]

C. A. Floudas, I. G. Akrotirianakis, S. Caratzoulas, C. A. Meyer, and J. Kallrath. Global optimization in the 21st century: Advances and challenges. Computers & Chemical Engineering, 29(6):1185–1202, 2005.

[96]

C. A. Floudas. Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, New York, NY, 1995.

[97]

C. A. Floudas. Deterministic Global Optimization: Theory, Algorithms and Applications, volume 37 of Nonconvex Optimization and Its Applications. Kluwer Academic Publishers, Dordrecht, Netherlands, 2000.

[98]

R. Fourer. Solving staircase linear programs by the simplex method – 1: Inversion. Mathematical Programming, 23(1):274–313, 1982.

[99]

J. Fourtany-Amat and B. McCarl. A representation and economic interpretation of a two-level programming problem. Journal of the Operational Research Society, 32(9):783–792, 1981.

[100]

K. Furman and I. P. Androulakis. A novel MINLP-based representation of the original complex model for predicting gasoline emissions. Computers & Chemical Engineering, 32(12):2857–2876, 2008.

[101]

K. Furman, N. Sawaya, and I. E. Grossmann. A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function. E-Print 5544, Optimization Online, 2016.

[102]

B. Galan and I. E. Grossmann. Optimal design of distributed wastewater treatment networks. Industrial & Engineering Chemistry Research, 37(10):4036–4048, 1998.

[103]

Gerald Gamrath, Tobias Fischer, Tristan Gally, Ambros M. Gleixner, Gregor Hendel, Thorsten Koch, Stephen J. Maher, Matthias Miltenberger, Benjamin Müller, Marc E. Pfetsch, Christian Puchert, Daniel Rehfeldt, Sebastian Schenker, Robert Schwarz, Felipe Serrano, Yuji Shinano, Stefan Vigerske, Dieter Weninger, Michael Winkler, Jonas T. Witt, and Jakob Witzig. The SCIP Optimization Suite 3.2. ZIB Report 15-60, Zuse Institute Berlin, 2016.

[104]

E. P. Gatzke, J. E. Tolsma, and P. I. Barton. Construction of convex relaxations using automated code generation techniques. Optimization and Engineering, 3(3):305–326, 2002.

[105]

A. M. Geoffrion. Elements of Large-Scale Mathematical Programming – I. Concepts. Management Science, 16(11):652–675, 1970.

[106]

V. Ghildyal and N. V. Sahinidis. Solving global optimization problems with BARON. In A. Migdalas, P. M. Pardalos, and P. Värbrand, editors, From Local to Global Optimization, volume 53 of Nonconvex Optimization and Its Applications, chapter 10, pages 205–230. Springer, 2001.

[107]

V. Ghildyal. Design and development of a global optimization system. Master's thesis, Department of Mechanical & Industrial Engineering, University of Illinois, Urbana, IL, 1997.

[108]

P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright. Two step-length algorithms for numerical optimization. Technical Report SOL 79–25, Department of Operations Research, Stanford University, Stanford, California, 1979.

[109]

P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright. User's guide for NPSOL (Version 4.0): a Fortran package for nonlinear programming. Technical Report SOL 86–2, Department of Operations Research, Stanford University, Stanford, CA, 1986.

[110]

P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright. Maintaining LU factors of a general sparse matrix. Linear Algebra and its Applications, 88-89:239–270, 1987.

[111]

P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright. A practical anti-cycling procedure for linearly constrained optimization. Mathematical Programming, 45(1-3):437–474, 1989.

[112]

P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright. Some theoretical properties of an augmented Lagrangian merit function. In P. M. Pardalos, editor, Advances in Optimization and Parallel Computing, pages 101–128. Elsevier Science Inc, 1992.

[113]

P. E. Gill, W. Murray, and M. A. Saunders. SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Journal on Optimization, 12(4):979–1006, 2002.

[114]

P. E. Gill, W. Murray, and M. A. Saunders. SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Review, 47(1):99–131, 2005.

[115]

P. E. Gill, W. Murray, and M. A. Saunders. User's guide for SQOPT version 7: Software for large-scale linear and quadratic programming. Numerical analysis report, Department of Mathematics, University of California, San Diego, La Jolla, CA, 2006.

[116]

C. E. Gounaris, R. Misener, and C. A. Floudas. Computational comparison of piecewise-linear relaxations for pooling problems. Industrial & Engineering Chemistry Research, 48(12):5742–5766, 2009.

[117]

L. Grippo, F. Lampariello, and S. Lucidi. A nonmonotone line search technique for Newton's method. SIAM Journal on Numerical Analysis, 23(4):707–716, 1986.

[118]

L. Grippo, F. Lampariello, and S. Lucidi. A class of nonmonotone stabilization methods in unconstrained optimization. Numerische Mathematik, 59(1):779–805, 1991.

[119]

Computational Mathematics Group. HSL 2002 – a catalogue of subroutines. Technical report, STFC Rutherford Appleton Laboratory, Harwell Oxford, 2002.

[120]

Omprakash K. Gupta and A. Ravindran. Branch and bound experiments in convex nonlinear integer programming. Management Science, 31:1533–1546, 1985.

[121]

R. A. Gutiérrez and N. V. Sahinidis. A branch-and-bound approach for machine selection in just-in-time manufacturing systems. International Journal of Production Research, 34(3):797–818, 1996.

[122]

P. T. Harker and J. S. Pang. Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications. Mathematical Programming, 48(1-3):161–220, 1990.

[123]

G. W. Harrison, T. F. Rutherford, and D. Tarr. Quantifying the Uruguay round. The Economic Journal, 107(444):1405–1430, 1997.

[124]

M. M. F. Hasan and I. A. Karimi. Piecewise linear relaxation of bilinear programs using bivariate partitioning. AIChE Journal, 56(7):1880–1893, 2010.

[125]

Alain Haurie and Jacek B. Krawczyk. Optimal charges on river effluent from lumped and distributed sources environmental modeling and assessment. Environmental Modeling & Assessment, 2(3):177–189, 1997.

[126]

C. A. Haverly. Studies of the behavior of recursion for the pooling problem. ACM SIGMAP Bulletin, 25:19–28, 1978.

[127]

J. Huang and J. S. Pang. Option pricing and linear complementarity. Journal of Computational Finance, 2(1):31–60, 1998.

[128]

P. J. Huber. Robust statistics. John Wiley & Sons, New York, 1981.

[129]

G. Infanger. DECIS User's Guide. 1590 Escondido Way, Belmont, CA 94002, 1997.

[130]

J. Jezowski. Review of water network design methods with literature annotations. Industrial & Engineering Chemistry Research, 49(10):4475–4516, 2010.

[131]

N. H. Josephy. Newton's method for generalized equations. Technical Summary Report 1965, Mathematics Research Center, University of Wisconsin, Madison, Wisconsin, 1979.

[132]

J. Kallrath. Cutting circles and polygons from area-minimizing rectangles. Journal of Global Optimization, 43(2-3):299–328, 2009.

[133]

R. Karuppiah and I. E. Grossmann. Global optimization for the synthesis of integrated water systems in chemical processes. Computers & Chemical Engineering, 30(4):650–673, 2006.

[134]

W. Karush. Minima of functions of several variables with inequalities as side conditions. Master's thesis, Department of Mathematics, University of Chicago, 1939.

[135]

George Karypis and Vipin Kumar. A fast and highly quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359–392, 1999.

[136]

Yoshiaki Kawajir, Carl Laird, and Andreas Wächter. Introduction to Ipopt: A tutorial for downloading, installing, and using Ipopt, 2087 edition, February 2012. https://projects.coin-or.org/Ipopt.

[137]

J. E. Kelley. The cutting-plane method for solving convex programs. Journal of the Society for Industrial and Applied Mathematics, 8(4):703–712, 1960.

[138]

A. Khajavirad and N. V. Sahinidis. Convex envelopes of products of convex and component-wise concave functions. Journal of Global Optimization, 52(3):391–409, 2012.

[139]

A. Khajavirad and N. V. Sahinidis. Convex envelopes generated from finitely many compact convex sets. Mathematical Programming, 137(1-2):371–408, 2013.

[140]

A. Khajavirad, J. J. Michalek, and N. V. Sahinidis. Relaxations of factorable functions with convex-transformable intermediates. Mathematical Programming, 144(1-2):107–140, 2014.

[141]

Y. Kim and M.C. Ferris. Solving equilibrium problems using extended mathematical programming, 2017.

[142]

G. R. Kocis and I. E. Grossmann. Relaxation strategy for the structural optimization of process flowsheets. Industrial & Engineering Chemistry Research, 26(9):1869–1880, 1987.

[143]

A. C. Kokossis and C. A. Floudas. Synthesis of isothermal reactor–separator–recycle systems. Chemical Engineering Science, 46(5-6):1361–1383, 1991.

[144]

A. C. Kokossis and C. A. Floudas. Optimization of complex reactor networks – II. Nonisothermal operation. Chemical Engineering Science, 49(7):1037–1051, 1994.

[145]

Jacek B. Krawczyk and Stanislav Uryasev. Relaxation algorithms to find nash equilibria with economic applications. Environmental Modeling & Assessment, 5(1):63–73, 2000.

[146]

H. W. Kuhn and A. W. Tucker. Nonlinear programming. In J. Neyman, editor, Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, pages 481–492, Berkeley and Los Angeles, 1951. University of California Press.

[147]

B. Lanz and T. F. Rutherford. Gtapingams: Multiregional and small open economy models. Journal of Global Economic Analysis, 1(2):1–77, 2016.

[148]

Y. Lebbah, C. Michel, and M. Rueher. A rigorous global filtering algorithm for quadratic constraints. Constraints, 10(1):47–65, 2005.

[149]

S. Lee and I. E. Grossmann. Global optimization of nonlinear generalized disjunctive programming with bilinear equality constraints: applications to process networks. Computers & Chemical Engineering, 27(11):1557–1575, 2003.

[150]

Jon Lee and Sven Leyffer, editors. Mixed Integer Nonlinear Programming, volume 154 of The IMA Volumes in Mathematics and its Applications. Springer, 2012.

[151]

H. Lee, J. M. Pinto, I. E. Grossmann, and S. Park. Mixed-integer linear programming model for refinery short-term scheduling of crude oil unloading with inventory management. Industrial & Engineering Chemistry Research, 35(5):1630–1641, 1996.

[152]

C. E. Lemke and J. T. Howson, Jr. Equilibrium points of bimatrix games. Journal of the Society for Industrial and Applied Mathematics, 12(2):413–423, 1964.

[153]

J. Li, A. Li, I. A. Karimi, and R. Srinivasan. Improving the robustness and efficiency of crude scheduling algorithms. AIChE Journal, 53(10):2659–2680, 2007.

[154]

J. Li, R. Misener, and C. A. Floudas. Continuous-time modeling and global optimization approach for scheduling of crude oil operations. AIChE Journal, 58(1):205–226, 2012.

[155]

L. Liberti and C. C. Pantelides. Convex envelopes of monomials of odd degree. Journal of Global Optimization, 25(2):157–168, 2003.

[156]

L. Liberti and C. C. Pantelides. An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms. Journal of Global Optimization, 36(2):161–189, 2006.

[157]

X. Lin and C. A. Floudas. Design, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation. Computers & Chemical Engineering, 25(4-6):665–674, 2001.

[158]

M.-L. Liu, N. V. Sahinidis, and J. P. Shectman. Planning of chemical process networks via global concave minimization. In I. E. Grossmann, editor, Global Optimization in Engineering Design, volume 9 of Nonconvex Optimization and Its Applications, pages 195–230. Springer, 1996.

[159]

A. Lundell and T. Westerlund. Convex underestimation strategies for signomial functions. Optimization Methods and Software, 24(4-5):505–522, 2009.

[160]

A. Lundell and T. Westerlund. Global optimization of mixed-integer signomial programming problems. In J. Lee and S. Leyffer, editors, Mixed Integer Nonlinear Programming, volume 154 of The IMA Volumes in Mathematics and its Applications, pages 349–369. Springer New York, 2012.

[161]

A. Lundell, J. Westerlund, and T. Westerlund. Some transformation techniques with applications in global optimization. Journal of Global Optimization, 43(2-3):391–405, 2009.

[162]

Stephen J. Maher, Tobias Fischer, Tristan Gally, Gerald Gamrath, Ambros Gleixner, Robert Lion Gottwald, Gregor Hendel, Thorsten Koch, Marco E. Lübbecke, Matthias Miltenberger, Benjamin Müller, Marc E. Pfetsch, Christian Puchert, Daniel Rehfeldt, Sebastian Schenker, Robert Schwarz, Felipe Serrano, Yuji Shinano, Dieter Weninger, Jonas T. Witt, and Jakob Witzig. The SCIP Optimization Suite 4.0. ZIB Report 17-12, Zuse Institute Berlin, 2017.

[163]

C. D. Maranas and C. A. Floudas. Finding all solutions of nonlinearly constrained systems of equations. Journal of Global Optimization, 7(2):143–182, 1995.

[164]

C. D. Maranas and C. A. Floudas. Global optimization in generalized geometric programming. Computers & Chemical Engineering, 21(4):351–369, 1997.

[165]

C. D. Maranas, I. P. Androulakis, C. A. Floudas, A. J. Berger, and J. M. Mulvey. Solving long-term financial planning problems via global optimization. Journal of Economic Dynamics and Control, 21(8-9):1405–1425, 1997.

[166]

J. Markusen and T. F. Rutherford. MPSGE: A user’s guide, February 2004. Lecture Notes Prepared for the UNSW Workshop.

[167]

L. Mathiesen. Computation of economic equilibria by a sequence of linear complementarity problems. In Alan S. Manne, editor, Economic Equilibrium: Model Formulation and Solution, volume 23 of Mathematical Programming Studies, pages 144–162. Springer, Berlin, Heidelberg, 1985.

[168]

L. Mathiesen. An algorithm based on a sequence of linear complementarity problems applied to a Walrasian equilibrium model: An example. Mathematical Programming, 37(1):1–18, 1987.

[169]

C. A. Meyer and C. A. Floudas. Convex envelopes for edge-concave functions. Mathematical Programming, 103(2):207–224, 2005.

[170]

C. A. Meyer and C. A. Floudas. Global optimization of a combinatorially complex generalized pooling problem. AIChE Journal, 52(3):1027–1037, 2006.

[171]

R. Misener and C. A. Floudas. Advances for the pooling problem: Modeling, global optimization, and computational studies. Applied and Computational Mathematics, 8(1):3–22, 2009.

[172]

R. Misener and C. A. Floudas. Global optimization of large-scale pooling problems: Quadratically constrained MINLP models. Industrial & Engineering Chemistry Research, 49(11):5424–5438, 2010.

[173]

R. Misener and C. A. Floudas. Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations. Mathematical Programming, 136(1):155–182, 2012.

[174]

R. Misener and C. A. Floudas. GloMIQO: Global Mixed-Integer Quadratic Optimizer. Journal of Global Optimization, 57(1):3–50, 2013.

[175]

R. Misener and C. A. Floudas. ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations. Journal of Global Optimization, 59(2-3):503–526, 2014.

[176]

R. Misener and C. A. Floudas. A framework for globally optimizing mixed-integer signomial programs. Journal of Optimization Theory and Applications, 161(3):905–932, 2014.

[177]

R. Misener, C. E. Gounaris, and C. A. Floudas. Mathematical modeling and global optimization of large-scale extended pooling problems with the (EPA) complex emissions constraints. Computers & Chemistry Engineering, 34(9):1432–1456, 2010.

[178]

R. Misener, J. P. Thompson, and C. A. Floudas. APOGEE: Global optimization of standard, generalized, and extended pooling problems via linear and logarithmic partitioning schemes. Computers & Chemistry Engineering, 35(5):876–892, 2011.

[179]

R. Misener, J. B. Smadbeck, and C. A. Floudas. Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2. Optimization Methods and Software, 30(1):215–249, 2015.

[180]

S. Mouret, I. E. Grossmann, and P. Pestiaux. A novel priority-slot based continuous-time formulation for crude-oil scheduling problems. Industrial & Engineering Chemistry Research, 48(18):8515–8528, 2009.

[181]

S. Mouret, I. E. Grossmann, and P. Pestiaux. A new Lagrangian decomposition approach applied to the integration of refinery planning and crude-oil scheduling. Computers & Chemical Engineering, 35(12):2750–2766, 2011.

[182]

B. A. Murtagh and M. A. Saunders. Large-scale linearly constrained optimization. Mathematical Programming, 14(1):41–72, 1978.

[183]

B. A. Murtagh and M. A. Saunders. A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints. In A. G. Buckley and J.-L. Goffin, editors, Algorithms for Constrained Minimization of Smooth Nonlinear Functions, volume 16 of Mathematic Programming Studies, pages 84–117. Springer, Berlin, Heidelberg, 1982.

[184]

B. A. Murtagh and M. A. Saunders. Minos 5.5 user's guide. Technical Report SOL 83-20R, Department of Operations Research, Stanford University, Stanford, CA, 1983. Revised 1998.

[185]

B. A. Murtagh and M. A. Saunders. Minos user's guide. Technical Report SOL 83-20, Department of Operations Research, Stanford University, Stanford, CA, 1983.

[186]

J. Nocedal and S. J. Wright. Numerical Optimization. Springer Series in Operations Research. Springer, 1999.

[187]

Jorge Nocedal, Andreas Wächter, and Richard A. Waltz. Adaptive barrier strategies for nonlinear interior methods. SIAM Journal on Optimization, 19(4):1674–1693, 2008.

[188]

V. Pham, C. Laird, and M. El-Halwagi. Convex hull discretization approach to the global optimization of pooling problems. Industrial & Engineering Chemistry Research, 48(4):1973–1979, 2009.

[189]

J. M. Ponce-Ortega, M. M. El-Halwagi, and A. Jiménez-Gutiérrez. Global optimization for the synthesis of property-based recycle and reuse networks including environmental constraints. Computers & Chemical Engineering, 34(3):318–330, 2010.

[190]

Ray Pörn and Tapio Westerlund. A cutting plane method for minimizing pseudo-convex functions in the mixed integer case. Computers & Chemical Engineering, 24(12):2655–2665, 2000.

[191]

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.

[192]

I. Quesada and I. E. Grossmann. A global optimization algorithm for linear fractional and bilinear programs. Journal of Global Optimization, 6(1):39–76, 1995.

[193]

I. Quesada and I. E. Grossmann. Global optimization of bilinear process networks with multicomponent flows. Computers & Chemical Engineering, 19(12):1219–1242, 1995.

[194]

S. Rebennack, J. Kallrath, and P. M. Pardalos. Column enumeration based decomposition techniques for a class of non-convex MINLP problems. Journal of Global Optimization, 43(2-3):277–297, 2009.

[195]

J. K. Reid. Fortran subroutines for handling sparse linear programming bases. Technical Report Report R8269, Atomic Energy Research Establishment, Harwell, England, 1976.

[196]

J. K. Reid. A sparsity-exploiting variant of the Bartels-Golub decomposition for linear programming bases. Mathematical Programming, 24(1):55–69, 1982.

[197]

L. M. Rios and N. V. Sahinidis. Portfolio optimization for wealth-dependent risk preferences. Annals of Operations Research, 177(1):63–90, 2010.

[198]

S. M. Robinson. A quadratically-convergent algorithm for general nonlinear programming problems. Mathematical Programming, 3(1):145–156, 1972.

[199]

S. M. Robinson. Normal maps induced by linear transformations. Mathematics of Operations Research, 17(3):691–714, 1992.

[200]

R. T. Rockafellar. Linear-quadratic programming and optimal control. SIAM Journal on Control and Optimization, 25(3):781–814, 1987.

[201]

R. T. Rockafellar. Lagrange multipliers and optimality. SIAM Review, 35(2):183–238, 1993.

[202]

R. T. Rockafellar. Extended nonlinear programming. In Gianni Di Pillo and Franco Giannessi, editors, Nonlinear Optimization and Related Topics, volume 36 of Applied Optimization, pages 381–399. Springer, Boston, MA, 1999.

[203]

J. P. Ruiz and I. E. Grossmann. Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks. Optimization Letters, 5(1):1–11, 2011.

[204]

T. F. Rutherford. Extensions of GAMS for complementarity problems arising in applied economic analysis. Journal of Economic Dynamics and Control, 19(8):1299–1324, 1995.

[205]

T. F. Rutherford. Applied general equilibrium modeling with mpsge as a gams subsystem: An overview of the modeling framework and syntax. Computational Economics, 14(1-2):1–46, 1999.

[206]

H. S. Ryoo and N. V. Sahinidis. Global optimization of nonconvex NLPs and MINLPs with applications in process design. Computers & Chemical Engineering, 19(5):551–556, 1995.

[207]

H. S. Ryoo and N. V. Sahinidis. A branch-and-reduce approach to global optimization. Journal of Global Optimization, 8(2):107–138, 1996.

[208]

H. S. Ryoo and N. V. Sahinidis. Analysis of bounds for multilinear functions. Journal of Global Optimization, 19(4):403–424, 2001.

[209]

H. S. Ryoo and N. V. Sahinidis. Global optimization of multiplicative programs. Journal of Global Optimization, 26(4):387–418, 2003.

[210]

N. V. Sahinidis and M. Tawarmalani. Applications of global optimization to process and molecular design. Computers & Chemical Engineering, 24(9-10):2157–2169, 2000.

[211]

N. V. Sahinidis and M. Tawarmalani. Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints. Journal of Global Optimization, 32(2):259–280, 2005.

[212]

N. V. Sahinidis, M. Tawarmalani, and M. Yu. Design of alternative refrigerants via global optimization. AIChE Journal, 49(7):1761–1775, 2003.

[213]

N. V. Sahinidis. BARON: A general purpose global optimization software package. Journal of Global Optimization, 8(2):201–205, 1996.

[214]

N. V. Sahinidis. Global optimization and constraint satisfaction: The branch-and-reduce approach. In Ch. Bliek, Ch. Jermann, and A. Neumaier, editors, Global Optimization and Constraint Satisfaction, volume 2861 of Lecture Notes in Computer Science, pages 1–16. Springer, 2003.

[215]

Y. Saif, A. Elkamel, and M. Pritzker. Global optimization of reverse osmosis network for wastewater treatment and minimization. Industrial & Engineering Chemistry Research, 47(9):3060–3070, 2008.

[216]

Olaf Schenk and Klaus Gärtner. Solving unsymmetric sparse systems of linear equations with pardiso. Journal of Future Generation Computer Systems, 20(3):475–487, 2004.

[217]

Olaf Schenk and Klaus Gärtner. On fast factorization pivoting methods for sparse symmetric indefinite systems. Electronic Transactions on Numerical Analysis, 23:158–179, 2006.

[218]

J. P. Shectman and N. V. Sahinidis. A finite algorithm for global minimization of separable concave programs. Journal of Global Optimization, 12(1):1–36, 1998.

[219]

H. D. Sherali and W. P. Adams. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, volume 31 of Nonconvex Optimization and Its Applications. Springer, Boston, MA, 1999.

[220]

H. D. Sherali and A. Alameddine. A new reformulation-linearization technique for bilinear programming problems. Journal of Global Optimization, 2(4):379–410, 1992.

[221]

H. D. Sherali and C. H. Tuncbilek. A reformulation-convexification approach for solving nonconvex quadratic-programming problems. Journal of Global Optimization, 7(1):1–31, 1995.

[222]

H. D. Sherali and C. H. Tuncbilek. New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems. Operations Research Letters, 21(1):1–9, 1997.

[223]

H. Sherali, E. Dalkiran, and L. Liberti. Reduced RLT representations for nonconvex polynomial programming problems. Journal of Global Optimization, 52(3):447–469, 2012.

[224]

Claus Still and Tapio Westerlund. Extended cutting plane algorithm. In C. A. Floudas and P. Pardalos, editors, Encyclopedia of Optimization, pages 593–601. Kluwer Academic Publishers, 2001.

[225]

F. Tardella. On the existence of polyhedral convex envelopes. In C. A. Floudas and P. M. Pardalos, editors, Frontiers in Global Optimization, volume 74 of Nonconvex Optimization and Its Applications, pages 563–573. Kluwer Academic Publishers, 2004.

[226]

F. Tardella. Existence and sum decomposition of vertex polyhedral convex envelopes. Optimization Letters, 2(3):363–375, 2008.

[227]

F. Tardella. On a class of functions attaining their maximum at the vertices of a polyhedron. Discrete Applied Mathematics, 22(2):191–195, 1988/89.

[228]

M. Tawarmalani and N. V. Sahinidis. Semidefinite relaxations of fractional programs via novel convexification techniques. Journal of Global Optimization, 20(2):133–154, 2001.

[229]

M. Tawarmalani and N. V. Sahinidis. Convex extensions and envelopes of lower semi-continuous functions. Mathematical Programming, 93(2):247–263, 2002.

[230]

M. Tawarmalani and N. V. Sahinidis. Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, volume 65 of Nonconvex Optimization and Its Applications. Kluwer Academic Publishers, 2002.

[231]

M. Tawarmalani and N. V. Sahinidis. Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Mathematical Programming, 99(3):563–591, 2004.

[232]

M. Tawarmalani and N. V. Sahinidis. A polyhedral branch-and-cut approach to global optimization. Mathematical Programming, 103(2):225–249, 2005.

[233]

M. Tawarmalani, S. Ahmed, and N. V. Sahinidis. Global optimization of 0-1 hyperbolic programs. Journal of Global Optimization, 24(4):385–416, 2002.

[234]

M. Tawarmalani, S. Ahmed, and N. V. Sahinidis. Product disaggregation in global optimization and relaxations of rational programs. Optimization and Engineering, 3(3):281–303, 2002.

[235]

P. Tseng. Growth behavior of a class of merit functions for the nonlinear complementarity problem. Journal of Optimization Theory and Applications, 89(1):17–37, 1996.

[236]

M. Türkay and I. E. Grossmannn. Logic-based MINLP algorithms for the optimal synthesis of process networks. Computers & Chemical Engineering, 20(8):959–978, 1996.

[237]

J. G. VanAntwerp, R. D. Braatz, and N. V. Sahinidis. Globally optimal robust control for systems with time-varying nonlinear perturbations. Computers & Chemical Engineering, 21, Supplement:S125–S130, 1997.

[238]

J. G. VanAntwerp, R. D. Braatz, and N. V. Sahinidis. Globally optimal robust process control. Journal of Process Control, 9(5):375–383, 1999.

[239]

A. Vecchietti and I. E. Grossmannn. LOGMIP: a disjunctive 0-1 non-linear optimizer for process system models. Computers & Chemical Engineering, 23(4-5):555–565, 1999.

[240]

A. Vecchietti, S. Lee, and I. E. Grossmannn. Modeling of discrete/continuous optimization problems: Characterizaton and formulations of disjunctions and their relaxations. Computers & Chemical Engineering, 27(3):433–448, 2003.

[241]

Stefan Vigerske and Ambros Gleixner. SCIP: Global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. ZIB Report 16-24, Zuse Institute Berlin, 2016.

[242]

Stefan Vigerske. Decomposition of Multistage Stochastic Programs and a Constraint Integer Programming Approach to Mixed-Integer Nonlinear Programming. PhD thesis, Humboldt-Universität zu Berlin, 2013.

[243]

J. Viswanathan and I. E. Grossmann. A combined penalty function and outer approximation method for minlp optimization. Computers & Chemical Engineering, 14(7):769–782, 1990.

[244]

V. Visweswaran. MINLP: Applications in blending and pooling. In C. A. Floudas and P. M. Pardalos, editors, Encyclopedia of Optimization, pages 2114–2121. Springer Science, second edition, 2009.

[245]

Andreas Wächter and Lorenz T. Biegler. Line search filter methods for nonlinear programming: Local convergence. SIAM Journal on Optimization, 16(1):32–48, 2005.

[246]

Andreas Wächter and Lorenz T. Biegler. Line search filter methods for nonlinear programming: Motivation and global convergence. SIAM Journal on Optimization, 16(1):1–31, 2005.

[247]

Andreas Wächter and Lorenz T. Biegler. On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Mathematical Programming, 106(1):25–57, 2006. http://projects.coin-or.org/Ipopt.

[248]

Andreas Wächter. An Interior Point Algorithm for Large-Scale Nonlinear Optimization with Applications in Process Engineering. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, January 2002.

[249]

R. A. Waltz, J. L. Morales, J. Nocedal, and D. Orban. An interior algorithm for nonlinear optimization that combines line search and trust region steps. Mathematical Programming, 107(3):391–408, 2006.

[250]

Tapio Westerlund and Frank Petterson. An extended cutting plane method for solving convex MINLP problems. Computers & Chemical Engineering, 19(suppl.):131–136, 1995.

[251]

Tapio Westerlund and Ray Pörn. Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. Optimization and Engineering, 3(3):253–280, 2002.

[252]

Tapio Westerlund, Hans Skrifvars, Iiro Harjunkoski, and Ray Pörn. An extended cutting plane method for solving a class of non-convex minlp problems. Computers & Chemical Engineering, 22(3):357–365, 1998.

[253]

D. S. Wicaksono and I. A. Karimi. Piecewise MILP under-and overestimators for global optimization of bilinear programs. AIChE Journal, 54(4):991–1008, 2008.

[254]

H. P. Williams. Model Building in Mathematical Programming. Wiley, 4th edition, 1999.

[255]

P. Wolfe. The reduced gradient method. RAND Corporation, 1962.

[256]

Kati Wolter. Implementation of cutting plane separators for mixed integer programs. Diploma thesis, Technische Universität Berlin, 2006.

[257]

S. J. Wright. Primal-Dual Interior-Point Methods. Other Titles in Applied Mathematics. Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 1997.

[258]

Roland Wunderling. Paralleler und objektorientierter Simplex-Algorithmus. PhD thesis, Technische Universität Berlin, 1996. http://soplex.zib.de.

[259]

Maryam Yashtini and Alaeddin Malek. Solving complementarity and variational inequalities problems using neural networks. Applied Mathematics, 190(1):216–230, 2007.

[260]

K. Zorn and N. V. Sahinidis. Computational experience with applications of bilinear cutting planes. Industrial & Engineering Chemistry Research, 52(22):7514–7525, 2013.

[261]

K. Zorn and N. V. Sahinidis. Global optimization of general non-convex problems with intermediate bilinear substructures. Optimization Methods and Software, 29(3):442–462, 2014.

[262]

K. Zorn and N. V. Sahinidis. Global optimization of general nonconvex problems with intermediate polynomial substructures. Journal of Global Optimization, 59(2-3):673–693, 2014.