Introduction to deterministic models of operations research including linear programming formulations, the simplex algorithm, degeneracy, geometry of convex polyhedra, duality theory, and sensitivity analysis. Special linear programming models for assignment, transportation, and network problems. Integer programming formulations along with branch and bound solution. Dynamic programming.
| Spring | Summer | Fall | ||
|---|---|---|---|---|
| (Session 1) | (Session 2) | |||
| 2025 | ||||
| 2024 | ||||
| 2023 | ||||
| 2022 | ||||
| 2021 | ||||
| 2020 | ||||
| 2019 | ||||
| 2018 | ||||
| 2017 | ||||
| 2016 | ||||
| 2015 | ||||
| 2014 | ||||
| 2013 | ||||
| 2012 | ||||
| 2011 | ||||
| 2010 | ||||
| 2009 | ||||
| 2008 | ||||
| 2007 | ||||
| 2006 | ||||
| 2005 | ||||
| 2004 | ||||
| 2003 | ||||
| 2002 | ||||
| 2001 | ||||
| 2000 | ||||
| 1999 | ||||
| 1998 | ||||