|
Mar 28, 2024
|
|
|
|
MTH 537 - Operations Research I(4 credits) Linear programming, including the simplex method, sensitivity analysis, duality, and integer programming. Additional topics selected from LU decomposition, dual simplex algorithm, game theory, Karmarkar’s algorithm, as well as topics from nonlinear programming, such as steepest descent and Kuhn-Tucker conditions. Part one of a two-part sequence.
Click here for the schedule of courses
Add to Portfolio (opens a new window)
|
|