IE 501 Linear Programming and Extensions
Select Term:
Theory of linear programming; convexity; simplex and algorithmic aspects; duality and sensitivity; computational issues; decomposition and column generation; introduction to integer and nonlinear programming.
SU Credits : 3.000
ECTS Credit : 10.000
Prerequisite :
-
Corequisite :
-