|
|
| (8 intermediate revisions by 2 users not shown) |
| Line 1: |
Line 1: |
| − | == 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):
| |
| − |
| |
| − | *
| |
| − |
| |
| − | === Additional topics ===
| |
| − |
| |
| − | === Courses for which this course is prerequisite ===
| |
| − |
| |
| − | [[Category:Courses|320]]
| |
