Math 4630/5630: Discrete Modeling and Optimization

Announcements

· Test 2 is on Tuesday, April 8 at class time. It will include the topics covered after Test 1. The focus is on Simplex Method, Branch-and-Bound, Cutting Planes. The test is closed book, closed notes.

· Test 1 is on Thursday, February 20 at class time. The test will include the material covered in the handouts up to the “Algebraic realization of Simplex”. The test is closed book, closed notes.

Course materials

• Syllabus
• Slides and handouts
• Homework
• AMPL models
• Practice problems on IP modeling
• Practice problem on cutting planes Solutions
• Practice problems for the Final

· Modeling problem

· Cutting planes problem

Useful links

• AMPL (software for solving linear, integer and non-linear programming problems)
• AMPL customers and case studies
• INFORMS Resources
• Linear Optimization with Applications
• Math Modeling: Getting Started and Getting Solutions

• Top ten algorithms of the 20th century

· Unimodular and totally unimodular matrices

· Powerpoint slides on Graph coloring

· Extra material on graph coloring

• Traveling Salesman Problem

· Bin Packing problem

· Cutting Stock problem

• Applications of Operations Research in Healthcare
• Applications to radiation therapy (slides 32 to 51)

 ·  Operations Research (includes Discrete Optimization) among best Technology jobs

• Links to student projects in Computational Mathematics