Complementarity-Based Nonlinear Programming Techniques for Optimal Mixing in Gas Networks

  • We consider nonlinear and nonsmooth mixing aspects in gas transport optimization problems and show that mixed-integer reformulations of pooling-type mixing models already render small-size instances intractable. Therefore we investigate the applicability of smooth nonlinear programming techniques for equivalent complementarity-based reformulations. Based on recent results for remodeling piecewise affine constraints using an inverse parametric quadratic programming approach, we show that classical stationarity concepts are meaningful for the resulting complementarity-based reformulation of the mixing equations. We test this approach numerically by comparing such a reformulation with a more compact complementarity-based one that does not feature such beneficial regularity properties. All computations are performed on publicly available data of real-world size problem instances from steady-state gas transport. Our numerical results show that both complementarity-based models outperform the mixed-integer reformulation significantly and that the complementarity-based model with beneficial regularity properties can be solved more reliable.

Download full text files

Export metadata

Author:Falk Hante, Martin Schmidt
Document Type:Preprint
Date of Publication (online):2017/09/12
Date of first Publication:2017/09/12
Release Date:2017/09/12
Tag:Complementarity constraints; Gas transport networks; Inverse parametric quadratic programming; MPCC; Mixing
Institutes:Friedrich-Alexander-Universität Erlangen-Nürnberg