Ma 391: Topics in Optimization
To edit course information, hover your mouse over this help box and click the pencil icon that appears above it. After you make changes, click Save, then click the check box that appears above this box to publish the changes.
A study of deterministic methods employed in operations research. Topics include specific cases of linear programming problems as well as integer and nonlinear programming. Prerequisite(s): Ma 150. 3 Credits.
Spring 2023 Course Information
- Instructor: Melissa Gardenghi
- Course Syllabus
Recommended Homework:
Textbook Website: www.mhhe.com/hillier
Be sure you've practiced implementing all algorithms (even if you think you totally understand it).
- 9.1-2, 9.2-2, 9.2-6, 9.2-20, 9.3-2 (b-f), 9.3-9, 9.4-1
- 10.3-2, 10.3-7, 10.4-3, 10.5-6 (a), 10.6-5 (a,b and (c or d)) and solve it using the network simplex
- 12.1-2, 12.1-6, 12.3-4, 12.4-7, 12.5-3, 12.6-3, 12.7-8, 12.8-1, 12.8-8, 12.8-11
- 13.2-5, 13.2-6 (a-c), 13.4-1 (I would use Excel to compute the function values ...), 13.5-1 (a-b), 13.6-3, 13.7-2 (a), 13.9-8, 13.9-15 (use the SUMT procedure and the gradient method)
- 14.2-4, 14.2-6
Tentative Schedule:
See Canvas for additional details/updates.
- Chapter 21: Jan 11 - 13
- Chapter 9: Jan 13 - 20
- Chapter 10: Jan 23 - Feb 6
- Chapter 12: Feb 8 - 27
- Chapters 13: March 1 - 17
- Chapter 20/Simulation: March 27 - April 10
- Multicriteria and Additional Topics: April 14 - 28
Assignments/Case Studies:
- Ch 10 Case Studies
- Ch 12 Case Studies
- Ch 13 Case Studies (you may also need Ch 3 Case Studies)
- Ch 20 Case Studies (you may also need Queueing Simulator, see pg 736 for simulator notation definitions)
- Chapter 21
These case studies give students the opportunity to develop the following professional competencies:
