Master of Science in Mathematics - Optimization

MATH 5246  Optimization


MATH 2037 and MATH 2046


Three hours of lecture per week for one term.




The course will present students with a broad overview of linear, non-linear, continuous, discrete and combinatorial optimization methods and algorithms. Topics include Simplex method, duality, integer programming, branch-and-bound, local search, Barvinok polynomials, gradient methods, Lagrange multipliers, convex optimization, linear Diophantine equations, optimal network flows, bipartite matchings, and others as chosen by the instructor.

Nipissing University
100 College Drive, Box 5002, North Bay, ON, Canada  P1B 8L7  Tel: 705.474.3450 | Fax: 705.474.1947 | TTY: 877.688.5507

© Nipissing University 2015DisclaimerPrivacyAccessibility