Save To Worklist

CPSC 406 Computational Optimization

Formulation and analysis of algorithms for continuous and discrete optimization problems; linear, nonlinear, network, dynamic, and integer optimization; large-scale problems; software packages and their implementation; duality theory and sensitivity.

This course is eligible for Credit/D/Fail grading. To determine whether you can take this course for Credit/D/Fail grading, visit the Credit/D/Fail website. You must register in the course before you can select the Credit/D/Fail grading option.

Credits: 3

Pre-reqs: One of CPSC 302, CPSC 303, MATH 307.

Status Section Activity Term Interval Days Start Time End Time Comments
FullCPSC 406 201Lecture2 Mon Wed Fri14:0015:00
CPSC 406 2W1Waiting List2 Mon Wed Fri14:0015:00