Course Learning Outcomes
- develop linear programming models
- solve linear programs using the Simplex Method and perform sensitivity analysis
- identify infeasible problems, optimal solutions and unboundedness
- identify degeneracy
- identify the relation between the primal and dual problems
- use interior point methods to solve linear programming problems
- use decomposition approaches to solve large scale linear programming problems
- solve linear programming models using software