Duration: 4 hours. This module will cover integer linear programming and its use in solving NP-hard (combinatorial optimization) problems. We will cover some examples of what integer linear ...

Linear programming formulation, simplex algorithm, optimality conditions, duality, practical computation, extensions, applications, and case studies. Learning Objectives Students will learn the ...