Search Results - subject:"MINLP"

Did you mean: subject:"milp" (42 results)

Optimization of capacity expansion in potential-driven networks including multiple looping : a comparison of modelling approaches

Lenz, Ralf; Becker, Kai Helge - In: OR spectrum : quantitative approaches in management 44 (2022) 1, pp. 179-224

Persistent link: https://www.econbiz.de/10013172688

Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches

Lenz, Ralf; Becker, Kai Helge - In: OR Spectrum 44 (2021) 1, pp. 179-224

In commodity transport networks such as natural gas, hydrogen and water networks, flows arise from nonlinear potential differences between the nodes, which can be represented by so-called potential-driven network models. When operators of these networks face increasing demand or the need to...

Persistent link: https://www.econbiz.de/10014497467

LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization

Codsi, Julien; Ngueveu, Sandra Ulrich; Gendron, Bernard - 2021

Persistent link: https://www.econbiz.de/10012622246

The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming

Muts, Pavlo; Nowak, Ivo; Hendrix, Eligius M. T. - In: Journal of Global Optimization 77 (2020) 1, pp. 75-96

This paper presents a new two-phase method for solving convex mixed-integer nonlinear programming (MINLP) problems … sub-problems (LP phase) is solved in order to rapidly generate a good linear relaxation of the original MINLP problem. In …-based MINLP solver implemented in Python and Pyomo. Preliminary numerical results based on 70 convex MINLP instances up to 2700 …

Persistent link: https://www.econbiz.de/10014503654

On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm

Serrano, Felipe; Schwarz, Robert; Gleixner, Ambros - In: Journal of Global Optimization 78 (2020) 1, pp. 161-179

Recently, Kronqvist et al. (J Global Optim 64(2):249–272, 2016) rediscovered the supporting hyperplane algorithm of Veinott (Oper Res 15(1):147–152, 1967) and demonstrated its computational benefits for solving convex mixed integer nonlinear programs. In this paper we derive the algorithm...

Persistent link: https://www.econbiz.de/10014504380