Network Optimization and Sensitivity
Prof. Dr. Matthias Gerdts
University of the Federal Armed Forces Munich, Germany
The short course addresses optimization techniques for problems that are defined on networks, e.g. shortest path problems, routing problems, transshipment problems or maximum flows. A special emphasis will be on the network simplex method and the analysis of the dependence of optimal solutions on data. Such a sensitivity analysis allows to quantify the risk that is associated with the implementation of an optimal solution subject to data uncertainties.
Short profile
Prof. Dr. Matthias Gerdts studied Mathematics with minor Computer Science at the University of Technology Clausthal, Germany, and graduated in 1997. He received his doctoral degree in 2001 and his habilitation in 2006 from the University of Bayreuth, Germany. In 2003 he was a visiting professor at the University of California, San Diego. From 2004 to 2007 he held a junior professorship for numerical optimal control at the Department of Mathematics of the University of Hamburg, Germany, and moved to a lecturer position for mathematical optimization at the University of Birmingham, U.K., from 2007 to 2009. From 2009-2010 he was an associate professor for optimal control at the University of Würzburg, Germany. Since 2010 he is a full professor for engineering mathematics at the Department of Aerospace Engineering of the University of the Federal Armed Forces in Munich, Germany. Primary research interests of Prof. Gerdts are optmal control, optimization techniques, model-predictive control, differential-algebraic equations, and sensitivity analysis with applications in automotive systems, robotics, and aerospace engineering.
