Class Time: Monday 5:00p - 7:40p, Humanities 130.
Instructor: Dr. Corbett Redden. Corbett.Redden [att] liu.edu. Office: Life Sciences 237. Phone: 516-299-3487.
Office Hours: Monday & Wednesday 12:30p - 2:00p, Monday & Tuesday 3:30p-4:45p, or by appointment
Course webpage: http://myweb.liu.edu/~dredden/521f16/
Homework/Syllabus: http://myweb.liu.edu/~dredden/521f16/Homework.html
Textbook: There is no required textbook for the course, but much of the material will be taken from the out-of-print book "Applied Mathematical Programming" by Bradley, Hax, and Magnanti. You can access a free pdf copy, or you can even purchase a cheap used copy.
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 one week later (Monday night) by 11:59p. You will turn in homework digitally by uploading photos or a scan of the homework via the website https://dropitto.me/Math521; the password is "hw". Please write the following information at the top of each page: your last name, the assignment letter, and the page number for your homework (e.g. "Redden HW b p.2"). Each homework assignment will be graded out of a possible 10 points according to the following rubric:
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 19 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.