
handle: 10630/35173
AbstractMost industrial optimization problems are sparse and can be formulated as block-separable mixed-integer nonlinear programming (MINLP) problems, defined by linking low-dimensional sub-problems by (linear) coupling constraints. This paper investigates the potential of using decomposition and a novel multiobjective-based column and cut generation approach for solving nonconvex block-separable MINLPs, based on the so-called resource-constrained reformulation. Based on this approach, two decomposition-based inner- and outer-refinement algorithms are presented and preliminary numerical results with nonconvex MINLP instances are reported.
Parallel computing, Decomposition, column generation, parallel computing, nonconvex optimization, global optimization, Column generation, 620, 510, Nonconvex optimization, Programación no lineal, Mixed integer programming, Nonlinear programming, Mixed-integer nonlinear programming, decomposition method, Global optimization, Decomposition method, mixed-integer nonlinear programming, Multi-objective and goal programming
Parallel computing, Decomposition, column generation, parallel computing, nonconvex optimization, global optimization, Column generation, 620, 510, Nonconvex optimization, Programación no lineal, Mixed integer programming, Nonlinear programming, Mixed-integer nonlinear programming, decomposition method, Global optimization, Decomposition method, mixed-integer nonlinear programming, Multi-objective and goal programming
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
