2007-2008
Homework 1 Standard Form, Canonical Form
Homework 4 Simplex Method
Homework
5 Simplex Method, Cone, Unbounded
Homework 8 Artificial Minimization
Homework
9 Curve Fitting, Big M Method
Homework
10 Cycling, Vogel's Va;ue Added Method
Homework
12 Sensitivity and Lexicographic
Order
Homework
13 Sensitivity, Duality
Homework
14 Dual Simplex Algorithm
Chapter I Linear Programming Problems
Chapter 2 Some Examples and Applications
Chapter 5 Sensitivity (Cost Coefficients)
Chapter 11 Sensitivity Revisited
Chapter 14 Complementary Slackness
Chapter 12 Upper Bound Methods
Chapter 16 Transportation Problem
Chapter 17 Transshipment Problem
Chapter 18 Primal Dual Algorithm
Chapter 19 KarmarkarŐs Algorithm
Least Absolute Deviations (LAD)
Maximal Flow – Ford Fulkerson Algorithm
Maximal Matching and the Hungarian Algorithm
Simplex Method on a Calculator
The Assignment Problem with the Hungarian Algorithm
Transshipment Problem from Chapter 17
Vogel Added Value Method for Initialization
Computer Material
á
Linear
Programming Package (myLPPackage`)
á
Linear
Programming Package Extras (myLPPackageExtras`)
á
Linear
Algebra Package (myLAPackage`)
á
Package
Demo 1 (Simplex Method, diagramMaker)
á
Package
Demo 2 Transshipment Problem
á
Package
Demo 3 Linear Programming Package Extras
Take Home Final