Refine
Document Type
- Article (5)
- Book chapter (3)
- In Proceedings (3)
- Doctoral Thesis (1)
Language
- English (12)
Has Fulltext
- no (12) (remove)
Is part of the Bibliography
- no (12)
Keywords
- Computations (1)
- Cutting Planes (1)
- Decomposition (1)
- Gas Network Planning (1)
- Nonconvexity (1)
- Pooling Problem (1)
- Quadratic Programming (1)
- Relaxations (1)
- Robust Optimization (1)
- Standard Quadratic Programming (1)
Institute
We propose an approach to solve the validation of nominations problem using mixed-integer nonlinear programming (MINLP) methods. Our approach handles both the discrete settings and the nonlinear aspects of gas physics. Our main contribution is an innovative coupling of mixed-integer (linear) programming (MILP) methods with nonlinear programming (NLP) that exploits the special structure of a suitable approximation of gas physics, resulting in a global optimization method for this type of problem.
In this article we investigate methods to solve a fundamental task in gas transportation, namely the validation of nomination problem: Given a gas transmission network consisting of passive pipelines and active, controllable elements and given an amount of gas at every entry and exit point of the network, find operational settings for all active elements such that there exists a network state meeting all physical, technical, and legal constraints.
We describe a two-stage approach to solve the resulting complex and numerically difficult feasibility problem. The first phase consists of four distinct algorithms applying linear, and methods for complementarity constraints to compute possible settings for the discrete decisions. The second phase employs a precise continuous programming model of the gas network. Using this setup, we are able to compute high quality solutions to real-world industrial instances that are significantly larger than networks that have appeared in the mathematical programming literature before.