MTH 521

**Class Time:** Monday 5:00p - 7:40p, Humanities 130.

**Instructor:** Dr. Corbett Redden. *Corbett.Redden [att] liu.edu*. Office: Winnick House 233. Phone: 516-299-3487.

**Office Hours:** Tuesday & Thursday 12:30p - 1:50p, or by appointment

**Course webpage:** http://myweb.liu.edu/~dredden/521f18/

**Homework/Syllabus:** http://myweb.liu.edu/~dredden/521f18/Homework.html

**Textbook:** I will use the textbook "Understanding and Using Linear Programming" by Jiri Matousek and Bernd Gartner (Springer Universitext, 2006). ISBN-13: 978-3540306979. It is an excellent text, and I will follow the book pretty closely. I will sometimes ask you to read certain sections and work appropriate problems before we cover the material in class. However, I will provide the homework problems since the textbook has few (if any) extra problems.

**Grading Scheme:**

Weekly Quizzes | 40% |

Homework Completion | 15% |

Midterm Test | 20% |

Final Exam | 25% |

**Quizzes:** There will be a short quiz every week. These will cover the homework due that day, and they will be graded for correctness. The lowest 2 quiz scores will be dropped.

**Homework:** Homework will be assigned each class. You may work with others, but each each person should independently and neatly write up their own solutions that include all supporting work. Unless stated otherwise, the homework is due by the beginning of class the following week. I will check each person's homework at the beginning of class for completeness and effort, but I will not collect it. The lowest 1 homework score will be dropped.

**Midterm Test:** An in-class midterm test will occur midway through the semester. The exact date will be announced at least two weeks in advance.

**Final Exam:** The Final Exam will be cumulative, and it will take place Monday, December 17 during the usual class time.

**Description from Catalog:** This course covers elementary linear algebra, convex geometry, linear programming problems, the simplex method. Also included is Tucker and Dantzig tableaux, duality, sensitivity analysis, solutions of the transportation and the assignment problems, and computational considerations. 3 credits.