| Winter Term 2021 Optimization - 1017 - MATH 435 |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
Prerequisites/Notes: MATH 230 and 250, or MATH 310 Catalog Description : The study of local and global maximums and minimums of function, given various sorts of constraints. Linear problems and the simplex algorithm, general non-linear problems and the Kuhn-Tucker conditions, convex problems. Perturbation of problem parameters and duality. Applications to a wide variety of fields, including economics, game theory, and operations research. PREREQUISITES: MATH 230 and 250, or MATH 310 Attributes: GER Quantitative Analysis, 400-599 Advanced Course
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
