Go to Main Content

Minerva

 

HELP | EXIT

Detailed Course Catalog Information

 

Fall 2017
Nov 23, 2017
Transparent Image
MATH 407 - Dynamic Programming.
Sequential decision problems, resource allocation, transportation problems, equipment replacement, integer programming, network analysis, inventory systems, project scheduling, queuing theory calculus of variations, markovian decision processes, stochastic path problems, reliability, discrete and continuous control processes.

Taught in alternate years
Winter
Prerequisites: COMP 202; MATH 223 or MATH 236, MATH 314, MATH 315 and MATH 323

3.000 Credit hours

Schedule Types: Lecture, Final Exam

Faculty of Science
Mathematics and Statistics Department

Restrictions:
May not be enrolled in one of the following Levels:     
      Doctorate
      Masters & Grad Dips & Certs
May not be enrolled in one of the following Faculties:     
      Faculty of Dentistry
      Faculty of Medicine
      School of Continuing Studies

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.5.4