Credits: 3.00
Description:
This course examines linear optimization problems with constraints; optimality conditions and duality theory, the simplex method, complexity of the simplex method, interior point methods, selected applications, network flow problems and the network simplex method.
Prerequisites: MA2312, MA2112.