| |
Apr 19, 2024
|
|
|
|
|
MATH 5620 - Linear and Nonlinear Optimization
Solution methods, theory and applications of linear and nonlinear optimization problems. The focus is on the mathematics of efficient optimization algorithms, such as Simplex method and steepest ascent. Applications include production planning, financial models, network problems, game theory.
Requisites:
Credit Hours: 3
Repeat/Retake Information: May not be retaken.
Lecture/Lab Hours: 3.0 lecture
Grades: Eligible Grades: A-F,WP,WF,WN,FN,AU,I
Learning Outcomes:
- Students will know how to formulate real-life problems as linear and nonlinear programs, apply algorithms to solve the problems, understand the theory behind the solution methods which will help them to analyze the algorithms and design new ones.
Add to Portfolio (opens a new window)
|
|
