This site uses cookies. By continuing to use this site, closing this banner, or clicking "I Agree", you agree to the use of cookies.
Read our cookies policy and privacy statement for more information.

×

Cleveland State University Course Info

Cleveland, Ohio

Favorite

Course Info

Search for courses by clicking on letters of the alphabet or by using a search bar. Explore course description, number of credits required and course sequences to satisfy graduation requirements.


MTH 537

Operations Research I

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.

Units: 4.0