We propose a decomposition algorithm for a special class of nonconvex mixed integer nonlinear programming problems which have an assignment constraint. If the assignment decisions are decoupled from the remaining constraints of the optimization problem, we propose to use a column enumeration approach. The master problem is a partitioning problem whose objective function coefficients are computed via subproblems. These problems can be linear, mixed integer linear, (non-)convex nonlinear, or mixed integer nonlinear. However, the important property of the subproblems is that we can compute their exact global optimum quickly. The proposed technique will be illustrated solving a cutting problem with optimum nonlinear programming subproblems.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Adjiman C.S., Androulakis I.P. and Floudas C.A. (1997). Global optimization of MINLP problems in process synthesis and design. Comput. Chem. Eng. 21(Suppl. S): S445–S450
Adjiman C.S., Androulakis I.P. and Floudas C.A. (2000). Global optimization of mixed-integer nonlinear problems. AICHE J. 46(9): 1769–1797
Androulakis I.P., Maranas C.D. and Floudas C.A. (1995). αBB: A global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7(4): 337–363
Dowsland K.A. and Dowsland W.B. (1992). Packing Problems. Euro. J. Oper. Res. 56: 2–14
Dyckhoff H. (1990). A Typology of Cutting and Packing Problems. Euro. J. Oper. Res. 44: 145–159
Fraser H.J. and George J.A. (1994). Integrated Container Loading Software for Pulp and Paper Industry. Euro. J. Oper. Res. 77: 466–474
Floudas, C.A.: Deterministic Global Optimization: Theory, Algorithms and Applications, vol. 37 of Nonconvex Optimization and Its Applications, pp. 309–554. Kluwer Academic Publishers (2000)
George J.A., George J.M. and Lamar B.W. (1995). Packing Different-sized Circles into a Rectangular Container. Euro. J. Oper. Res. 84: 693–712
Huang W.Q., Li Y., Akeb H. and Li C.M. (2005). Greedy Algorithms for Packing Unequal Circles into a Rectangular Container. J. Oper. Res. Soc. 56(5): 539–548
Kallrath, J.: Online Storage Systems and Transportation Problems with Applications: Optimization Models and Mathematical Solutions, vol. 91 of Applied Optimization, pp. 92–104. Kluwer Academic Publishers, Norwell, MA (2004)
Kallrath, J.: Cutting circles and polygons from area-minimizing rectangles. J. Glob. Optim (2008). doi: 10.1007/s10898-007-9274-6
Lindo Systems: Lindo API: User’s Manual. Lindo Systems, Inc., Chicago (2004)
Lenstra J.K. and Rinnooy Kan A.H.G. (1979). Complexity of Packing, Covering and Partitioning Problems. In: Schrijver, A. (eds) Packing and Covering in Combinatorics, pp 275–291. Mathematisch Centrum, Amsterdam
Liberti, L., Maculan, N. (eds.): Global Optimization: From Theory to Implementation, vol. 84 of Nonconvex Optimization and Its Applications, pp. 223–232. Springer (2006)
Pintér, J.D.: Continuous global optimization software: A brief review. Optima, 52, 1–8 (1996a). See also http://plato.la.asu.edu/gom.html
Pintér J.D. Global Optimization in Action: Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications, vol. 6 of Nonconvex Optimization and Its Applications. Kluwer Academic Publishers (1996b)
Pardalos P.M., Resende M.G.C. (eds.): Handbook of Applied Optimization pp. 337–351. Oxford University Press (2002)
Ryoo H.S. and Sahinidis N.V. (1995). Global optimization of non-convex NLPs and MINLPs with application in process design. Comput. Chem. Eng. 19(5): 551–566
Ryoo H.S. and Sahinidis N.V. (1996). A branch-and-reduce approach to global optimization. J. Glo. Optim. 8(2): 107–138
Sahinidis N.V. (1996). BARON: A general purpose global optimization software package. J. Glob. Optim. 8(2): 201–205
Schrage L. (2006). Optimization Modeling with LINGO. LINDO Systems, Inc., Chicago, IL
Stoyan Y.G. and Yaskov G.N. (1998). Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. Int. Trans. Oper. Res. 5(1): 45–57
Stoyan Y.G. and Yaskov G.N. (2004). A mathematical model and a solution method for the problem of placing various-sized circles into a strip. Euro. J. Oper. Res. 156: 590–600
Wilhelm W. E. (2001). A technical review of column generation in integer programming. Optim. Eng. 2: 159–200
About this article
Cite this article
Rebennack, S., Kallrath, J. & Pardalos, P.M. Column enumeration based decomposition techniques for a class of non-convex MINLP problems. J Glob Optim 43, 277–297 (2009). https://doi.org/10.1007/s10898-007-9271-9
- Column enumeration