Course»Course 15»Fall 2010»15.093J»Homepage

15.093J  Optimization Methods

Fall 2010

Instructor: Sebastian Pokutta

TA: Claudio A. Telha Cornejo

Lecture:  TTh 10:00-11:30  (E52-175)
Recitation:  F 1:00-2:00  (66-168)
Office hours:  T 12:00-1:00  (E62-560)
TA office hours:  W 5:00-6:00  (E51-242)  

Information: 

Introduces the principal algorithms for linear, network, discrete, nonlinear, dynamic optimization and optimal control. Emphasis on methodology and the underlying mathematical structures. Topics include the simplex method, network flow methods, branch and bound and cutting plane methods for discrete optimization, optimality conditions for nonlinear optimization, interior point methods for convex optimization, Newton's method, heuristic methods, and dynamic programming and optimal control methods.

Announcements

Happy holidays

Dear class,

I also would like to thank you for the great time. I hope you enjoyed the class! As Claudio already said, the final grades should be online/available soon.

All the best,
Sebastian

Announced on 17 December 2010  4:56  p.m. by Sebastian Pokutta

Final exam

Dear class,

Thank you for attending the course, I do hope you have enjoyed it. For me, it was an awesome experience.

The final exam grades are online. And the letter grades will be on websis as they are processed.

Happy holidays,

Claudio

Announced on 16 December 2010  2:51  p.m. by Claudio A. Telha Cornejo

Lecture Notes 22 online

Dear class,

I just uploaded the slides from the SDP lecture.

All the best,
Sebastian Pokutta

Announced on 11 December 2010  8:10  p.m. by Sebastian Pokutta

Final Exam details

Dear class,

The exam will start at 9:00 am on Monday.
The room is E62-223 (E62 is the new building next to E52)
You can use 1 sheet of paper (letter size) of handwritten notes.

Regards,
Claudio

Announced on 10 December 2010  5:39  p.m. by Claudio A. Telha Cornejo

Recitation today

Dear class,
There is recitation today, but it is optional. We won't cover anything new. It will just be a problem on approximation algorithms and maybe one on Dynamic Programming.

Claudio

Announced on 10 December 2010  10:41  a.m. by Claudio A. Telha Cornejo

View archived announcements