Ma 391: Topics in Optimization
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 2021 Course Information
- Instructor: Melissa Gardenghi
- Course Syllabus
- Course Website
Recommended Homework:
Complete study notes with algorithms outlined as well as Summary of Optimization Techniques assignment before beginning problems. 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)
- 23. ... TBD
Tentative Schedule:
See Canvas for any changes.
- Chapter 9/Application Paper: Jan 13 - 20
- Chapter 10/Ch 21 Problems: Jan 22 - Feb 8
- Case Study 9, 10, or 21 due: Feb 15
- Chapter 12: Feb 10 - March 1
- Chapters 13: March 3 - 17
- Case Study 12, 13, or 21 due: March 24
- Chapter 20/Simulation: March 19 - April 2
- Simulation Case Study due: April 5
- Chapter 27/23/Multicriteria: April 5 - 28
Chapter 27
Chapter 23 - Cumulative Final Exam
Assignments/Case Studies:
Case Study Assignment I may have an alternate Case Study option for someone with an interest in tackling an ill-defined problem that may need stronger programming skills. If you are interested, let me know.
- 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:
