CSC 445/545 Class Notes: Fall 2006

1. NEW: Some examples of problems with floating point computations.
   An example to show potential loss of precision in floating point computations: Add_Loss.java
   An example which shows how error can be compounded by repreated floating point computations: Repeat_Add.java
2. Notes 1.1: Some applications of linear programming.
3. Notes 1.2: Cycling example.
4. Notes 1.3: Two Phase Example
5. Notes 1.4: Practice with the 2-phase method.
6. Notes 1.5: Setting up Two-Phase Systems by Hand
7. Notes 1.6: How fast is the Simplex method?
8. Notes 2.1: Text Example for Duality, p. 54
9. Notes 2.2: Solving the dual problem by the 2-phase method
10. Notes 2.3: Another Example of Duality
11. Notes 2.4: Primal and Dual Feasible Solutions
12. Notes 2.5: Proof of the Duality Theorem
13. Notes 3.1: Primal/Dual- Feasible, Infeasible, Unbounded Combinations
14. Notes 3.2: Certificates of Optimality
15. Notes 3.3: Complementary Slackness
16. Notes 3.4: Small changes to the bi's
17. Notes 3.5: Economic Interpretation of Dual Variables
18. Notes 3.6: Another Economic Example
19. Notes 4.1: Computing LU-factorizations
20. Notes 5.1: The Revised Simplex Method
21. Notes 5.2: Eta Factorizations
22. Notes 6.1: The Network Simplex Method
23. Notes 7.1: Solving Integer Programs by Separation
24. Notes 7.2: Solving Integer Programs by Cutting Plane Techniques