DM515 – Introduction to linear and integer programming

• J. Matousek and B. Gartner. Understanding and Using Linear Programming. Springer Berlin Heidelberg, 2007
  • Siderne: 1-94, 131-156, 201-215 (most importantly complementary slackness).

• J. Clausen and J. Larsen. Supplementary notes to networks and integer programming. Lecture Notes, DTU, 2009.
  • Siderne: 5-18

• E. Andersen. How to use Farkas's Lemma to say something important about linear infeasible problems. MOSEK Technical Repot TR-2011-1. 2011.
  • Siderne: 1-6

• L.A. Wolsey. Integer programming. John Wiley & Sons, New York, USA, 1998
  • Siderne: 1-63, 91-108, 113-127, 139-142

• J. Bang-Jensen and G. Gutin. Flows in Networks. Chapter 4, Digraphs: Theory, Algorithms and Applications, Springer London, 2009
  • Siderne: 97-99, 127-190

• A. Schrijver. Theory of Linear and Integer Programming. Wiley Interscience, 1986.
  • Siderne: 8-14

• V. Chvatal. Linear Programming. W.H.Freeman, 1983
  • Siderne: 97-111, 158-163, 260-263

• Alle oovelser som kan findes på kursushjemmesiden (evt. via Blackboard)).
• Emnerne fra de obligatoriske projekter findes på kursushjemmesiden (evt. via Blackboard).

Samlet sidetal: 337 sider plus oovelsesseddler.