Using projected cutting planes in the extended cutting plane method

References

• Duran M, Grossmann IE. An outer approximation algorithm for a class of mixed-integer nonlinear programs. Math Program. 1986;36:307–339.
   Web of Science ®Google Scholar
• MINLP Library 2. Mixed-integer nonlinear programming library; 2020. Available from: http://www.minlplib.org/
   Google Scholar
• Bussieck MR, Vigerske S. MINLP solver software. In Wiley encyclopedia of operations research and management science;. 2010. doi:10.1002/9780470400531.eorms0527.
   Google Scholar
• Bonami P, Kilinic M, Linderoth J. Algorithms and software for convex mixed integer nonlinear programs. In: Lee J, Leyffer S, editors. Mixed integer nonlinear programming. The IMA volumes in mathematics and its applications, Vol. 154. New York: Springer; 2012. p. 1–39.
   Google Scholar
• Westerlund T, Pettersson F. An extended cutting plane method for solving convex MINLP problems. Comput Chem Engin Sup. 1995;19:131–136.
   Web of Science ®Google Scholar
• Kelley JE. The cutting plane method for solving convex programs. J SIAM. 1960;8:703–712.
   Web of Science ®Google Scholar
• Westerlund T, Skrifvars H, Harjunkoski I, et al. An extended cutting plane method for a class of non-convex MINLP problems. Comput Chem Eng. 1998;22:357–365.
   Web of Science ®Google Scholar
• Westerlund T, Pörn R. Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. Optim Eng. 2002;3:253–280.
   Web of Science ®Google Scholar
• Eronen VP, Mäkelä MM, Westerlund T. On the generalization of ECP and OA methods to nonsmooth convex MINLP problems. Optimization. 2014;63:1057–1073.
   Web of Science ®Google Scholar
• Eronen VP, Mäkelä MM, Westerlund T. Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems. Optimization. 2015;64:641–661.
   Web of Science ®Google Scholar
• Eronen VP, Kronqvist J, Westerlund T, et al. Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems. J Global Optim. 2017;69:443–459.
   Web of Science ®Google Scholar
• Westerlund T, Eronen V-P, Mäkelä MM. On solving generalized convex MINLP problems using supporting hyperplane techniques. J Global Optim. 2018;71:987–1011.
   Web of Science ®Google Scholar
• Horst R, Tuy H. Global optimization. 3rd ed. Heidelberg: Springer-Verlag; 1996.
   Google Scholar
• Pörn R. Mixed integer non-linear programming: convexification techniques and algorithm development [PhD thesis]. Abo Akademi University; 2000.
   Google Scholar
• Censor Y, Lent A. Cyclic subgradient projections. Math Program. 1982;24:233–235.
   Web of Science ®Google Scholar
• Bauschke HH, Borwein JM. On projection algorithms for solving convex feasibilty problems. SIAM Rev. 1996;38:367–426.
   Web of Science ®Google Scholar
• Bauschke HH, Combettes PL. A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces. Math Oper Res. 2001;26:248–264.
   Web of Science ®Google Scholar
• D'Antonio GH, Frangioni F. Convergence analysis of deflated conditional approximate subgradient methods. SIAM J Optim. 2009;20:357–386.
   Web of Science ®Google Scholar
• IBM ILOG Optimization Studio. CPLEX User's Manual, version 12.7. IBM; 2017.
   Google Scholar
• Gurobi. Gurobi optimizer reference manual. version 9.0. Gurobi Optimization, LCC; 2020.
   Google Scholar
• Emet S, Westerlund T. Comparisons of solving a chromatographic separation problem using MINLP methods. Comput Chem Eng. 2004;28:673–682.
   Web of Science ®Google Scholar
• Serrano F, Schwarz R, Gleixner A. On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm. J Global Optim. 2020;78:161–179.
   Web of Science ®Google Scholar
• Kronqvist J, Lundell A, Westerlund T. The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming. J Global Optim. 2016;64:249–272.
   Web of Science ®Google Scholar
• Veinott Jr AF. The supporting hyperplane method for unimodal programming. Oper Res. 1967;15:147–152.
   Web of Science ®Google Scholar
• Westerlund T. User's guide for GAECP, version 5.537. An interactive solver for generalized convex MINLP-problems using cutting plane and supporting hyperplane teqniques. Abo Akademi University. 2017. Available from: http://www.abo.fi/twesterl/GAECPDocumentation.pdf
   Google Scholar
• Mäkelä MM, Neittaanmäki P. Nonsmooth optimization: analysis and algorithms with applications to optimal control. Singapore: World Scientific Publishing Co.; 1992.
   Google Scholar
• Bagirov A, Karmitsa N, Mäkelä MM. Introduction to nonsmooth optimization. Heidelberg: Springer Cham; 2014. (Theory, practice and software).
   Google Scholar
• Fletcher R, Leyffer S. Solving mixed integer nonlinear programs by outer approximation. Math Program. 1994;66:327–349.
   Web of Science ®Google Scholar
• Castillo I, Westerlund J, Emet S, et al. Optimization of block layout design problems with unequal areas: a comparison of MILP and MINLP optimization methods. Comput Chem Engin. 2005;30:54–69.
   Web of Science ®Google Scholar
• Scholz D, Petrick A, Domschke W. STaTS: A slicing tree and tabu search based heuristic for unequal area facility layout. Eur J Oper Res. 2009;197:166–178.
   Web of Science ®Google Scholar
• Kulturel-Konak S, Konak A. Unequal area flexible bay facility layout using ant colony optimization. Int J Product Optim. 2011;49:1877–1902.
   Web of Science ®Google Scholar
• Goncalves JF, Resende MGC. A biased random-key genetic algorithm for unequal area facility layout problem. Eur J Oper Res. 2015;246:86–107.
   Web of Science ®Google Scholar
• Konak A, Kulturel-Konak S, Norman BA, et al. A new mixed integer programming formulation for facility design using flexible bays. Oper Res Lett. 2006;34:660–672.
   Web of Science ®Google Scholar
• Kronqvist J, Lundell A, Westerlund T. Reformulations for utilizing separability when solving convex MINLP problems. J Global Optim. 2018;71:571–592.
   Web of Science ®Google Scholar
• Zarali F, Yazagan HR, Delice Y. A new solution method of ant colony-based logistic center area layout problem. Sãdhanã. 2018;83:1–17.
   Google Scholar
• Bazaraa MS. Computerized layout design; a branch and bound approach. AIIE Trans. 1975;7:432–438.
   Google Scholar
• van Camp DJ, Carter MW, Vanelli A. A nonlinear optimization approach for solving facility layout problems. Eur J Oper Res. 1991;57:174–189.
   Web of Science ®Google Scholar
• Castillo I, Westerlund T. An epsilon-accurate model for optimal unequal-area block layout design. Comput Oper Res. 2005;32:429–447.
   Web of Science ®Google Scholar
• Liu Q, Meller RD. A sequence-pair representation and MIP-model-based heuristic for the facility layout problem with rectangular departments. IIE Trans. 2007;39:377–394.
   Web of Science ®Google Scholar