Mathematical Models for Decision Making

SA367 ■ Spring 2017
Assoc. Prof. Nelson Uhan

Announcements

25 Apr
  • You have until the beginning of class on Thursday 27 April to submit Quiz 10 for the first time. If you submit Quiz 10 by noon on Wednesday, I will have it graded for you in class on Thursday.
  • The Final Exam will take place on Thursday 11 May at 7:55 in CH170. For more details, see below.
18 Apr

Plan for the end of the semester

T 18 Apr Finish Lesson 19 — work in groups
Start working on Quiz 10
R 20 Apr Finish Lesson 19 — work in groups
Continue working on Quiz 10
T 25 Apr Quiz 10 due at the beginning of class
Final exam details
Student opinion forms
Office hours, work on resubmissions
R 27 Apr Office hours, work on resubmissions
T 2 May Office hours, work on resubmissions

Resubmissions for the end of the semester

  • Starting this week, you may resubmit two quizzes/exams per week.
  • The last day to resubmit a quiz/exam is Tuesday 2 May.
28 Mar

Resubmission policy for Exam 2

  • You may discuss the exam problems with other midshipmen in class on Tuesday 28 March.
  • All work you submit must still reflect your own understanding.
  • All other instructions for resubmissions still hold.
9 Mar

Plan for week after Spring Break

T 21 Mar Review — dynamic programming
W 22 Mar Exam EI, 19:00 - 20:00 in CH348
R 23 Mar Exam 2

Exam 2

  • Covers lessons 7-14.
  • You will not be asked to write code, but you may be asked to read and interpret code.
  • No outside materials allowed.
2 Feb

Plan for next week

T 7 Feb Quiz 4 due at the beginning of class
Review
W 8 Feb Exam EI, 19:00 - 20:00 in CH348
R 9 Feb Exam 1

Exam 1

  • Covers lessons 1-6.
  • You will not be asked to write code, but you may be asked to read and interpret code.
  • No outside materials allowed.
19 Jan

Instructions for resubmissions

  • Redo the problems you want to resubmit on a blank quiz (see below).
  • Follow the guidelines in the course policy statement. In particular:
    • No collaboration allowed. All work must be your own.
    • You may use your own course materials (e.g., notes, homework), as well as any materials directly linked from the course website. You may not use any other materials.
    • Your resubmissions must include the following signed honor statement:
      I pledge on my honor that I have not used any unauthorized materials, and that I have not given or received any unauthorized assistance for this resubmission.
12 Jan Welcome!

Show older announcements

General information

Python Resources

Homework

Date Problems
6 Apr Baytheon and Farkas Investments, revisited (zip)
4 Apr Farkas Investments
Bring your computers to the next class.
30 Mar Baytheon
9 Mar Pear Computers - recursion
7 Mar Dynamic Distillery - recursion
2 Mar Markov Micromanufacturing (zip)
Finish the example at the end of Lesson 11.
28 Feb Airlift planning (zip)
21 Feb Dynamic Distillery and Pear Computers, revisited (zip)
Bring your computers to the next class.
16 Feb Pear Computers
Bring your computers to the next class.
14 Feb Dynamic Distillery
2 Feb Reverse engineering
31 Jan Finish the example at the end of Lesson 6.
Bring your computers to the next class.
26 Jan Shapley Sneakers and Simplexville Wireless, revisited (zip)
Bring your computers to the next class.
24 Jan Practice with Python (zip)
Bring your computers to the next class.
19 Jan Simplexville Wireless
Bring your computers to the next class.
17 Jan Primal Praline Company
Follow at least Step 1 of these instructions to install Python and Jupyter on your computer. Bring your computers to the next class.
12 Jan Familiarize yourself with the course policy statement.
Shapley Sneakers

Lessons

Dates Lesson
13 Apr 19 Solving the points-after-touchdown problem
11 Apr 18 The points-after-touchdown problem
6 Apr 17 Solving stochastic dynamic programs with Python
4 Apr 16 Stochastic dynamic programming, cont. notes
30 Mar 15 Stochastic dynamic programming notes
21 Mar Review – dynamic programming
9 Mar 14 Formulating DP recursions, cont.
  • 7 Mar
  • 9 Mar
 13 The principle of optimality and formulating DP recursions notes
2 Mar 12 Machine scheduling notes
  • 28 Feb
  • 2 Mar
 11 Drafting a fantasy basketball team
23 Feb 10 Big DPs and the curse of dimensionality notes
21 Feb 9 Solving dynamic programs with networkx
16 Feb 8 Dynamic programming, cont.
14 Feb 7 Introduction to dynamic programming notes
  • 31 Jan
  • 2 Feb
 6 The mileage running problem
26 Jan 5 Solving shortest path problems with networkx
24 Jan 4 Introduction to Jupyter and Python zip
19 Jan 3 Project management and the critical path method notes
17 Jan 2 The shortest path problem, cont. notes
12 Jan 1 Introduction, the shortest path problem notes

Quizzes

Date Quiz
18 Apr Quiz 10
11 Apr Quiz 9
7 Mar Quiz 8
28 Feb Quiz 7
21 Feb Quiz 6
7 Feb Quiz 4
31 Jan Quiz 3
24 Jan Quiz 2
17 Jan Quiz 1

Exams

Date Exam
11 May Final Exam
23 Mar Exam 2
9 Feb Exam 1