| |
Jun 16, 2024
|
|
|
|
|
MATH 4620 - 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: MATH 3300 and (3200 or 3210 ) and (3600 or CS 2300 or 2400 or ET 2100)
Credit Hours: 3
Repeat/Retake Information: May be retaken two times excluding withdrawals, but only last course taken counts.
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, and 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)
|
|
