LP and MIP solving in theory and practice

Host Institution:

CARMA, University of Newcastle

Title of Seminar:

LP and MIP solving in theory and practice

Speaker's Name:

Professor Martin Groetschel

Speaker's Institution:

Institute of Mathematics, Technical University of Berlin

Time and Date:

Monday 11 October 2010 at 2:30 pm

Seminar Abstract:

There are many algorithms with which linear programs (LPs) can be solved (Fourier-Motzkin, simplex, barrier, ellipsoid, subgradient, bundle, …).

I will provide a very brief review of these methods and their advantages and disadvantages. An LP solver is the main ingredient of every solution method (branch&bound, cutting planes, column generation, …) for (NP hard) mixed-integer linear programs (MIPs).

What combinations of which techniques work well in practice? There is no general answer. I will show, by means of many practical examples from my research group (telecommunication, transport, traffic and logistics, energy, …), how large scale LPs and MIPs are successfully attacked today.

Sponsored by CARMA - Computer Assisted Research Mathematics and its Applications - at the University of Newcastle.

Seminar Convenor:

This email address is being protected from spambots. You need JavaScript enabled to view it.

AGR IT support:

This email address is being protected from spambots. You need JavaScript enabled to view it.