Skip to main content

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 2019 Course Information

Homework Assignments:

  • 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)
  • 21-1, 21-2, 21-4, 21-5 (20 points) - due (paper copy) by end of day Thursday, April 25
  • 23. ... TBD
  • Multicriteria Homework

Tentative Schedule:

  • Chapter 12:  Jan 9 - 23
  • Chapter 13:  Jan 25 - February 11
  • Bible Conference
  • Chapters 9/10: February 18 - March 13
  • Case Study 12, 13, or 21 due:  February 25
  • Chapter 20:  March 15 - April 1
  • Chapter 23/Multicriteria:  April 3 - 24
    Chapter 23
  • Case Study 9, 10, or 21 due:  April 22
  • Cumulative Final Exam

 Case Study Files:

Case Study Assignment

** due date for the simulation case study has been extended to end of day, Monday, April 8 - NO LATE submissions will be accepted

Written Assignments:

Written Assignments

Summary of Techniques due by end of day, Saturday, April 27 - scanned pdf copies by email is sufficient