Mixed integer models for the stationary case of gas network optimization

A gas network basically consists of a set of compressors and valves that are connected by pipes. The problem of gas network optimization deals with the question of how to optimize the flow of the gas and to use the compressors cost-efficiently such that all demands of the gas network are satisfied....

Full description

Saved in:
Bibliographic Details
Published in:Mathematical programming 2006-02, Vol.105 (2-3), p.563-582
Main Authors: MARTIN, Alexander, MÖLLER, Markus, MORITZ, Susanne
Format: Article
Language:English
Subjects:
Algorithms
Applied mathematics
Applied sciences
Approximation
Compressors
Consumption
Energy consumption
Exact sciences and technology
Gas flow
Integer programming
Linear programming
Mathematical models
Mathematical problems
Mathematical programming
Network management systems
Operational research and scientific management
Operational research. Management science
Optimization
Partial differential equations
Studies
Variables
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A gas network basically consists of a set of compressors and valves that are connected by pipes. The problem of gas network optimization deals with the question of how to optimize the flow of the gas and to use the compressors cost-efficiently such that all demands of the gas network are satisfied. This problem leads to a complex mixed integer nonlinear optimization problem. We describe techniques for a piece-wise linear approximation of the nonlinearities in this model resulting in a large mixed integer linear program. We study sub-polyhedra linking these piece-wise linear approximations and show that the number of vertices is computationally tractable yielding exact separation algorithms. Suitable branching strategies complementing the separation algorithms are also presented. Our computational results demonstrate the success of this approach. [PUBLICATION ABSTRACT]
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-005-0665-5