Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks

DOI10.1007/s10898-020-00974-0zbMath1473.90093OpenAlexW3006134215MaRDI QIDQ2045011

Frauke Liers, Dennis Michaels, Nick Mertens, Alexander Martin, Maximilian Merkert

Publication date: 11 August 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-020-00974-0

zbMATH Keywords

convex envelopemixed-integer nonlinear programmingsimultaneous convexificationgas network optimization

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Related Items

Tight convex relaxations for the expansion planning problem

Uses Software

• SCIP
• MINLP
• ANTIGONE
• GasLib

Cites Work

• Unnamed Item
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• A new reformulation-linearization technique for bilinear programming problems
• A convex envelope formula for multilinear functions
• Convex extensions and envelopes of lower semi-continuous functions
• Convex envelopes of monomials of odd degree
• Convex envelopes for edge-concave functions
• A polyhedral branch-and-cut approach to global optimization
• Convex envelopes generated from finitely many compact convex sets
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• On convex envelopes for bivariate functions over polytopes
• Mixed integer models for the stationary case of gas network optimization
• Computable representations for convex hulls of low-dimensional quadratic forms
• Global Optimization with Polynomials and the Problem of Moments
• Evaluating Gas Network Capacities
• The Cutting-Plane Method for Solving Convex Programs
• The Convex Envelope of (n–1)-Convex Functions
• Convex relaxations for mixed-integer nonlinear programs
• Mixed-integer nonlinear optimization
• On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
• Semidefinite relaxations of fractional programs via novel convexification techniques