Math 30210 --- Introduction to operations research

University of Notre Dame, Fall 2007

Presentations

• December 5: An economic game theory example


• December 3: Branch and Bound algorithm for the travelling salesman problem


• November 30: URL for Traveling Salesman Problem: http://www.tsp.gatech.edu/


• November 28: Lawyer problem


• November 26: Branch and Bound algorithm for integer programming problems


• November 2: Economic interpretation of the dual


• October 31: Relations between primal and dual


• October 29: Primal-dual dictionary


• October 17: Changing the objective --- sensitivity analysis


• October 15: The diet problem --- sensitivity analysis


• October 12: Sensitivity analysis


• October 5: Full summary of Simplex method


• September 18: Preliminary summary of Simplex method


• September 14: Going from graphic to algebraic understanding


• September 10: Converting an LP to standard form


• September 7: Oil blending problem
  • The TORA file for this problem


• September 5: Air Force transportation problem
  • Figure 5
  • Figure 6
  • Figure 7
  • The TORA file for this problem
  (Figures taken from An Illustrated guide to linear programming, Saul Gass, Dover.)


• September 5: Meatloaf problem


• August 31: Diet problem


• August 29: Decision time

Back to the course home page