A polytope

Unit 2: Linear Programming: The Simplex Method

Week 38: Class 4

Contents:

  • Geometry and Algebra of Linear programming theory
  • Fundamental theorem of linear programming
  • Gaussian Elimination
  • Simplex method
  • Tableaux and dictionaries (Tutorial -> Python Review -> Python for matrix operations)

Resources:

  • Reading: [F pp 33-48]; [MG ch 5]; [HL sc 4.1-4.4]
  • Last slides from Lecture 2
  • Slides: [PDF]
  • LN pp 15-25: [PDF]

Week 38: Exercise Class 2

  • Sheet 2: [PDF]. [Solutions]. [Solution code] (originally this sheet was longer but the seond half of exercises has been moved to sheet 3.)

Week 39: Class 5

Contents:

  • Exception Handling, degeneracies, pivot rules,
  • Initialization

Resources:

  • Slides: [PDF]
  • LN pp 30-36: [PDF]
  • Cyckling example: sheet 2 compendium: [PDF]
  • Reading: [F pp 48-58]; [MG ch 5]; [HL sc 4.5]; [TR];

Week 39: Exercise Class 3

  • Sheet 3: [PDF]. [[Solutions][630]].

This site uses Just the Docs, a documentation theme for Jekyll.