Operations Research Bard College

Operations Research

Announcements

Final: The Final Exam will be in-class on Monday, May 18. Here are some practice problems for the exam:

And here are some practice problems from the textbook along with answers to the non-starred problems (starred problems from the textbook have answers in the back of the book).

Projects: The final project for this course involves giving a talk on a topic related to Graph Theory. You can work in groups of 2 or 3 people, or you can work by yourself. The following page contains a list of possible project topics:

Excel Files: Here are the Excel files from class:

Course Requirements

Your grade will be based on homework assignments (40%), two in-class exams (40%), and a project (20%).

Assignments and Tentative Syllabus

Week Dates Topics Readings Homework
Week 1 Jan. 26, 28 Introduction Chapters 1–3  
Week 2 Feb. 2, 4 Linear Programming Chapter 3 Homework 1
Week 3 Feb. 9, 11 The Simplex Algorithm Sections 4.1–4.5 Homework 2
Week 4 Feb. 16, 18 More on the Simplex Algorithm Section 4.6 Homework 3
Week 5 Feb. 23, 25 Sensitivity Analysis and Duality Sections 4.7, 6.1 Homework 4
Week 6 March 2, 4 Intro to Game Theory Sections 14.1–14.3 Homework 5
Week 7 March 9, 11 Game Theory Sections 14.4–14.7 Homework 6
Spring Break        
Week 8 March 23, 25 Midterm Exam    
Week 9 March 30, April 1 The Tranportation and Assignment Problems Sections 8.1, 8.3–8.5 Homework 7
Week 10 April 6, 8 Shortest Path, Minimum Cost Flow Sections 9.1–9.3, 9.6 Homework 8
Week 11 April 13, 15 Integer Programming, Branch and Bound Sections 11.1–11.7 Homework 9
Week 12 April 20, 22 Nonlinear Programming Sections 12.1–12.6 Homework 10
Week 13 April 27, 29 Nonlinear Programming Sections 12.1–12.6 Homework 11
Week 14 May 4, 6 Nonlinear Programming, Presentations    
Week 15 May 11, 13 Presentations    
Week 16 May 18 Final Exam