Efficient reformulation and solution of a nonlinear PDE-controlled flow network model

Authors:
A. Fügenschuh;S. Göttlich;M. Herty;C. Kirchner;A. Martin
Affiliations:
Technische Universität Darmstadt, Fachbereich Mathematik, Darmstadt, Germany;Technische Universität Kaiserslautern, Fachbereich Mathematik, Kaiserslautern, Germany;RWTH Aachen University, Aachen, Germany;Technische Universität Kaiserslautern, Fachbereich Mathematik, Kaiserslautern, Germany;Technische Universität Darmstadt, Fachbereich Mathematik, Darmstadt, Germany
Venue:
Computing
Year:
2009

Citing 5
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations

SIAM Journal on Scientific Computing
MIP presolve techniques for a PDE-based supply chain model

Optimization Methods & Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a flow network where the flow of parts can be controlled at the vertices of the network. Based on a modified coarse grid discretization presented in Fügenschuh et al. (SIAM J Scientific Comput 30(3):1490–1507, 2008) we derive a mixed-integer program (MIP). Under suitable assumptions on the cost functional we prove that there exists an equivalent linear program (LP). We present numerical results concerning validity of our result and show the improvement of the computing times using the equivalent LP over the MIP.