Math 354: Section H6, Summer 2004 (01:640:354:H6:83504)
Linear Optimization
July 12 - August 17
Mondays, Tuesdays, Thursdays, 6:15-8:45 in Scott Hall 206
Official course description:
Linear programming problems, the
simplex method,
duality theory,
sensitivity analysis,
introduction to
integer programming,
the transportation problem,
network flows, and other applications.
Prerequisite: Linear Algebra, 640:250.
My information:
- Vince Vatter
- Office: Hill Center 624
- Office hours: Tuesdays 5:00-6:00 in Scott Hall 206, Wednesdays 5:30-7:00 at West End
- Email: vatter@math.rutgers.edu
Text:
Kolman and Beck, Elementary Linear Programming with Applications, 2nd ed., Academic press, 1995.Grades:
We will have homework, quizzes, two midterm exams, and a cumulative final exam.
Late homework and make-up quizzes will not be accepted or given without a good excuse.
The grades break down as follows:
| Homework | 30% |
| Quizzes | 15% |
| Midterm #1 | 15% |
| Midterm #2 | 15% |
| Final Exam | 25% |
Schedule:
| Lecture | Date | Sections | Topics |
|---|---|---|---|
| 1 | Mon 7/12 | 1.1,0.1-0.3 | Introduction to Linear Programming, brief review of Linear Algebra |
| 2 | Tue 7/13 | 0.4,0.5,1.2,1.3 | Brief review of Linear Algebra (continued), matrix notation for Linear Programming problems, geometry of Linear Programming problems Quiz #1: pdf or LaTeX Solutions to Quiz #1: pdf or LaTeX |
| 3 | Thur 7/15 | 1.4,1.5 | The Extreme Point Theorem, basic solutions Homework #1 (pdf or TeX) due Solutions to Homework #1: pdf or LaTeX |
| 4 | Mon 7/19 | 2.1 | The Simplex Method Nice examples of the Simplex Method Here are examples that are even more fun! Homework #2 (pdf or LaTeX) due Solutions to Homework #2: pdf or LaTeX |
| 5 | Tue 7/20 | 2.2,2.3 | a little bit of Degeneracy and cycling, artificial variables Quiz #2 (covering convexity and the Extreme Point Theorem, guaranteed to be proof-free): pdf or LaTeX Solutions to Quiz #2: pdf or LaTeX |
| 6 | Thur 7/22 | Catch up and review Homework #3 (pdf or LaTeX) due Solutions to Homework #3: pdf or LaTeX | |
| 7 | Mon 7/26 |
Midterm #1: pdf or LaTeX Midterm #1 solutions: pdf or LaTeX Midterm #1 review problems: pdf or LaTeX Solutions to above review problems: pdf or LaTeX (Thanks to Drew Sills for letting me steal these problems from his midterm.) | |
| 8 | Tue 7/27 | 3.1,3.2 | Duality and the Duality Theorem |
| 9 | Thur 7/29 | 3.3,3.4 |
the Dual Simplex Method In-class not-to-be-turned-in problem: pdf or LaTeX Solution to the above: pdf or LaTeX Homework #4 (pdf or LaTeX) due Solutions to Homework #4: pdf or LaTeX |
| 10 | Mon 8/2 | 3.5,3.6,4.1 |
The Revised Simplex Method, Sensitivity Analysis, introduction to Integer Programming Homework #5 (pdf or LaTeX) due Solutions to Homework #5: pdf or LaTeX |
| 11 | Tue 8/3 | 4.2,4.3 |
Cutting Plane Methods, Branch and Bound Methods Quiz #3: pdf or LaTeX Solutions to Quiz #3: pdf or LaTeX |
| 12 | Thur 8/5 |
Catch up and review Homework #6 due: turn in solutions to problems 5, 7, and 8 from the Midterm #2 review problems below | |
| 13 | Mon 8/9 |
Midterm #2: pdf or LaTeX Midterm #2 solutions: pdf or LaTeX Midterm #2 review problems: pdf or LaTeX Solutions to above review problems: pdf or LaTeX | |
| 14 | Tue 8/10 | 5.3,5.4 |
graphs and networks, the Maximal Flow Problem Description of the Ford-Fulkerson Algorithm with nice examples in Java Handout explaining the Ford-Fulkerson Algorithm: pdf or LaTeX |
| 15 | Thur 8/12 | 5.1,5.2,5.5 |
The Shortest Route Problem, the Transportation Problem, the Assignment Problem Quiz #4: pdf or LaTeX Solutions to Quiz #4: pdf or LaTeX |
| 16 | Mon 8/16 |
Review Homework #7 (pdf or LaTeX) due Solutions to Homework #7: pdf or LaTeX | |
| 17 | Tue 8/17 |
(Cumulative) Final Exam Final Exam review problems: pdf or LaTeX Solutions to the above problems: pdf or LaTeX |
Leave anonymous feedback here:
\n"); print("| \n"); print("\n"); print(" |
| \n"); print("\n"); print(" |
| "); print("Steal this feedback box."); print(" |
Thank you for your comments.
\n"); } ?>