2005
DOI: 10.1007/s10107-005-0665-5
|View full text |Cite
|
Sign up to set email alerts
|

Mixed Integer Models for the Stationary Case of Gas Network Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
165
0
1

Year Published

2007
2007
2018
2018

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 202 publications
(167 citation statements)
references
References 14 publications
1
165
0
1
Order By: Relevance
“…Some optimization problems involving non-convex piecewise linear functions can be found in applications such as water networks, heat exchanger networks, and distillation sequences [86] stationary gas network optimization [87], merge-in-transit distribution systems, including the integration of inventory and transportation decisions [88], among others.…”
Section: Piecewise Linear Functions and Non-convex Optimizationmentioning
confidence: 99%
“…Some optimization problems involving non-convex piecewise linear functions can be found in applications such as water networks, heat exchanger networks, and distillation sequences [86] stationary gas network optimization [87], merge-in-transit distribution systems, including the integration of inventory and transportation decisions [88], among others.…”
Section: Piecewise Linear Functions and Non-convex Optimizationmentioning
confidence: 99%
“…(In fact, this was already suggested by Beale [70] and Tomlin [52] in the context of non-convex NLPs.) A recent exploration of this idea was conducted by Martin et al [27]. As well as constructing such PLFs, they also propose adding cutting planes to tighten the relaxation.…”
Section: Conversion To An Milpmentioning
confidence: 99%
“…and because the objective function tangents represented by (49) and (51) that utilize piecewise linear approximations (e.g., see Martin et al 2006, where the focus is on nonseparable functions). Moreover, by suitably increasing the number of segments, T , in the MIP approximation, along with the number of tangential supports, t + 1 , for the objective function to obtain sufficient granularity, we can accordingly derive a desired near-optimal solution to problem NETO.…”
Section: Algorithm A3: Mixed-integer Programmingmentioning
confidence: 99%