SA367 ■ Spring 2018
Assoc. Prof. Nelson Uhan
26 Apr |
|
|||||||||
2 Apr | The deadline to resubmit a quiz/exam for the 12-week marking period is 8:00 on Monday 9 April. | |||||||||
20 Mar |
Plan for next week
Exam 2
|
|||||||||
13 Feb | The deadline to resubmit a quiz/exam for the 6-week marking period is at the beginning of class on Tuesday 20 February. | |||||||||
1 Feb |
Plan for next week
Exam 1
|
|||||||||
22 Jan |
Instructions for resubmissions
|
|||||||||
11 Jan | Welcome! |
Date | Problems |
17 Apr | Finish formulating the model in Lesson 20. Bring your computers to the next class. |
12 Apr | Baytheon and Farkas Investments, revisited (zip) |
10 Apr | Bring your computers to the next class. |
5 Apr | Farkas Investments |
3 Apr | Baytheon |
8 Mar | Dynamic Distillery - recursion |
6 Mar | Pear Computers - recursion |
1 Mar | Shortest path recursions |
27 Feb | Markov Micromanufacturing (zip)
Finish the example at the end of Lesson 10. |
22 Feb | Airlift planning (zip) |
20 Feb | Bring your computers to the next class. |
15 Feb | Dynamic Distillery and Pear Computers, revisited (zip)
Bring your computers to the next class. |
13 Feb | Pear Computers
Bring your computers to the next class. |
1 Feb | Dynamic Distillery |
30 Jan | Reverse engineering |
25 Jan | Shapley Sneakers and Primal Praline Company, revisited (zip)
Bring your computers to the next class. |
18 Jan | Practice with Python (zip)
Bring your computers to the next class. |
16 Jan | Primal Praline Company
Follow these instructions to install Python and Jupyter on your computer. Bring your computers to the next class. |
11 Jan |
Familiarize yourself with the course policy statement.
Shapley Sneakers |
Dates | Lesson | ||
19 Apr | 21 | Solving the points-after-touchdown problem | |
17 Apr | 20 | The points-after-touchdown problem | |
12 Apr | 19 | Solving stochastic dynamic programs with Python | |
10 Apr | 18 | Stochastic dynamic programming, cont. | Notes |
5 Apr | 17 | Stochastic dynamic programming, cont. | Notes |
3 Apr | 16 | Stochastic dynamic programming, cont. | Notes |
23 Mar | 15 | Introduction to stochastic dynamic programming | Notes |
20 Mar | 14 | Review – dynamic programming | |
|
13 | Formulating dynamic programming recursions | |
|
12 | The principle of optimality and formulating recursions | Notes |
27 Feb | 11 | Machine scheduling | Notes |
|
10 | Drafting a fantasy basketball team | |
20 Feb | 9 | Big DPs and the curse of dimensionality | Notes |
15 Feb | 8 | Solving dynamic programs with networkx | |
13 Feb | 7 | Dynamic programming, cont. | |
|
6 | Introduction to dynamic programming | Notes |
|
5 | The mileage running problem | |
25 Jan | 4 | Solving shortest path problems with networkx | |
|
3 | Introduction to Jupyter and Python | |
16 Jan | 2 | The shortest path problem, cont. | Notes |
11 Jan | 1 | Introduction and the shortest path problem | Notes |
Date | Quiz | |
24 Apr | Quiz 8 | |
12 Apr | Quiz 7 | |
22 Mar | Quiz 6 | |
1 Mar | Quiz 5 | |
22 Feb | Quiz 4 | |
1 Feb | Quiz 3 | |
25 Jan | Quiz 2 | |
18 Jan | Quiz 1 |
Date | Exam | |
7 May | Final Exam | |
29 Mar | Exam 2 | |
8 Feb | Exam 1 |