Difference between revisions of "Garbage 3"
From MathWiki
(Created page with "== Catalog Information == === Title === === (Credit Hours:Lecture Hours:Lab Hours) === === Offered === === Prerequisite === === Description === == Desired Learning Outcomes...") |
(→Catalog Information) |
||
Line 2: | Line 2: | ||
=== Title === | === Title === | ||
+ | Computation and Optimization 1 | ||
=== (Credit Hours:Lecture Hours:Lab Hours) === | === (Credit Hours:Lecture Hours:Lab Hours) === | ||
+ | (3:3:1) | ||
=== Offered === | === Offered === | ||
+ | F | ||
=== Prerequisite === | === Prerequisite === | ||
+ | [[Math 290]], [[Math 313]], [[Math 314]]; concurrent with [[Math 334]], [[Math 344]], [[Math 321]] | ||
+ | |||
=== Description === | === Description === | ||
+ | A treatment of algorithms used to solve these problems. Specific topics include Complexity and Data, Approximation Theory, Recursive Algorithms, Linear Optimization, Unconstrained Optimization, Constrained Optimization, Global Optimization. | ||
== Desired Learning Outcomes == | == Desired Learning Outcomes == |
Revision as of 12:46, 6 June 2012
Contents
Catalog Information
Title
Computation and Optimization 1
(Credit Hours:Lecture Hours:Lab Hours)
(3:3:1)
Offered
F
Prerequisite
Math 290, Math 313, Math 314; concurrent with Math 334, Math 344, Math 321
Description
A treatment of algorithms used to solve these problems. Specific topics include Complexity and Data, Approximation Theory, Recursive Algorithms, Linear Optimization, Unconstrained Optimization, Constrained Optimization, Global Optimization.
Desired Learning Outcomes
Prerequisites
Minimal learning outcomes
Textbooks
Possible textbooks for this course include (but are not limited to):