Purple leaf

MA632A: Optimization (Fall 2017)

Calendar Description

Fundamental concepts of linear and non-linear optimization theory for developing algorithms and models are discussed. Topics include: duality and problem structure for finding, recognizing and interpreting solutions; network optimization problems; problems with integer constraints; combinatorial optimization problems; the simplex algorithm for linear programming; linear programming duality and complementary slackness; the network simplex algorithm; Newton and gradient methods for unconstrained optimization; Lagrange multipliers; penalty and barrier methods for constrained optimization; and an introduction to interior-point methods for linear and convex programming. Search techniques for hard problems may be included. The output of appropriate computer packages is analyzed.


Professor Kathie Cameron (PhD)
Office location: LH3041 (Lazaridis Hall)
Office hours: Tuesday 12:30 p.m. - 2 p.m. and Thursday 10:30 a.m. - noon. Other times by appointment or chance.
Email: kcameron@wlu.ca
Telephone: x2651


Tuesday and Thursday 4:15 p.m. - 5:35 p.m. in LH3068 (Lazaridis Hall)


Materials related to this course and the full course outline will be posted on the MA632 MyLearningSpace website. You are responsible for checking here on a regular basis for important announcements.


A final mark out of 100 will be calculated as follows:

  • Assignments: 25%
  • Midterm Test (Tuesday, Oct. 31, 4 p.m. - 5:20 p.m.): 25%
  • Final Exam (2.5 hours, exact date, time and location to be announced): 50%

The final mark will be reported as a letter grade in accordance with the conversion table of the current undergraduate calendar.

This document is a summary of the course outline for MA632 and is provided for the convenience of students.

Unknown Spif - $key