Uncategorized

Final exam solutions are available on the Notes page. If you would like to get back your exam scripts, please arrange to pick it up directly from us.

Happy Holidays!

The notes from Laura’s recitation is posted here or on the Notes page.

There are some typos in the lecture notes. These have been corrected and uploaded.

Here’s a summary of where the corrections are located:

Notes labelled 1026 (Lagrange Duality)
-  Statement of strong duality before Definition 1
-  (KKT2) equation
- Exercise 4
- Equation (5)

Notes labelled 1104 (Log Barrier)
-  Equation (4)

Here are the remaining office hours before the exam:

Wed 12/8, 12pm – 1pm (Laura)
Thurs 12/9 3pm (Chia)
Thurs 12/9 4pm (Kenny)
Tues 12/14 5pm (K & C)

We are also available by appointment.

I made a mistake in class about finding the augmenting path. When identifying the augmenting path, you must first draw the residual network WITHOUT any arrows. This is important. An augmenting path is a path from the source to the sink such that the residual capacity is strictly positive. **Note that the augmenting can be in the direction counter to the allowable direction of the network (this is to allow redirections of a particular path that maybe more efficient)**. Look at iteration #7 in section 9.5 for the example with the Seervada Park network. The augmenting path is O->C->E->B->D->T. This is okay even though the particular path is not feasible, i.e. the direction E->B is NOT allowable. This step redirects the flow to increase the total number of cars traveling.  With this, it does not matter what order of augmenting paths you pick. Your answer will be unique.

The final exam will take place on

Thursday, Decemeber 16,
2pm – 5pm,
Wilson Hall 302.

1. Topics:
   • Cumulative, including material before and after the midterm exam;
   • Everything covered in class until 12/07
   • All lecture notes posted in the Notes page (except the one labelled “0923″ and “l1magic″)
   • HW1-10, all problems, solutions and exercises
   • Only portions of H&L textbook that was explicitly included in class/notes/HW
   • No coding, but the algorithms are also covered
2. Format:
   • Total time: 3 hr
   • 4-5 problems (it will be designed as a 1hr 30 mins exam.)
   • ~40% of total points will come from class or HW problems.
3. Cheat sheet:
   • Two (2) letter-sized sheets of paper
   • Closed book
4. Extra credit problem:
   • 1 extra credit problem, to be completed during the exam.

As stated in the syllabus, the final exam will constitute 35% of your final grade.

A reminder that the H&L 9e textbook is on course reserves at the SciLi. If you would like to check it out, go to the desk in the basement of SciLi with the call no. X9 APMA 1210 PROF 1, and you will get it on 24hr loan.

As mentioned in class, HW10 is now available. HW10 will be due on Monday 12/13 at 5pm.

Also, a typo in the Quadratic programming notes has been corrected. (The KKT matrix for the Newton step is corrected.) Make sure you use the updated version.

Edit: Many apologies for the smattering of typos. They are all over the place. The notes have been corrected yet again, so make sure you use the newest version. A reminder: keep a healthy suspicion of what I have typed into the notes, and let me know if you find any more typos.

For those of you doing the project, Professor Clifton has provided his powerpoint slides. These are posted in Dropbox at this link:

https://dropbox.brown.edu/download.php?hash=710092e0

The password is: APMA1210

Recitation and all office hours on Thanksgiving week will be cancelled. If you want to meet with any of us, feel free to make an appointment.

Recitation will resume the following week, Nov 29. Laura will begin a review for the final exams. Plan on attending and plan ahead for your final exam reviews.

See you in class this Tuesday. Happy Thanksgiving.