Math 442/542: Theory of linear and nonlinear programming

Announcements

• The final exam is on Tuesday, March 13 at 10:10 am. The test is cumulative. A little emphasis will be on the material covered after test 2. The test is closed book, closed notes, three sheets of reminders allowed.
• Test 2 is on Thursday, February 22 at class time. It will include the material covered after Test 1 till the Network Models of the last handout (not including). The test is closed book, closed notes, one sheet of reminders allowed.

· Test 1 is on Thursday, Jan. 25 at class time. It will include the material covered in the handouts up to "Breaking ties, degeneracy" (not including). Closed book, closed notes, one sheet of reminders is allowed.

---

Course materials

• Syllabus
• Handouts (applications of linear programming)

• Solution of the Regression problem on AMPL

---

Useful links

• AMPL (software for solving linear, integer and non-linear programming problems)
• Mathprog (software accompanying the textbook)
• INFORMS Resources
• Operations Research Models and Methods -- an online introduction to OR
• John Mitchell's Optimization Pointers
• Math Programming in Action
• Top ten algorithms of the 20th century
• Bland's anti-cycling rule
• Baseball Elimination Problem (handout about theoretical details)
• Baseball Elimination Problem (a link to its practical usage)