• Speaker: Prof Martin Groetschel, Institute of Mathematics, Technical University of Berlin
  • Title: LP and MIP solving in theory and practice
  • Location: Room V206, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Access Grid Venue: UNewcastle [ENQUIRIES]
  • Time and Date: 2:30 pm, Mon, 11th Oct 2010
  • 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.

  • [Permanent link]