Design of efficient algorithms that exploit the structure of large scale optimization problems. Relaxation; decomposition; sparse systems; simplex with bounded variables; cutting plane methods and heuristic algorithms; effective computation techniques for real life applications.
SU Credits : 3.000
ECTS Credit : 10.000
Prerequisite :
-
Corequisite :
-