Dette kursus bygger på den teoretiske base af tidligere OR kurser og giver studerende muligheden for at programmere en avanceret dekompositionsalgoritme til at løse store kombinatoriske optimeringsproblemer. Fokus er først på at analysere matematiske formuleringer for at vælge en passende dekompositionsmetode, siden skifter fokus til implementering af sådanne algoritmer. For et mere teoretisk perspektiv på dekompositionsmetoder, opfordres studerende til at tage kursus 42136. En studerende, der fuldt ud har opfyldt kursets mål, vil kunne:

• State possible decomposition methods
• Understand why decomposition methods are necessary for large-scale combinatorial optimization problems
• Mathematically decompose large-scale combinatorial optimization problems by applying decomposition algorithms optimization problems
• Analyse mathematical formulations in order to select an appropriate solution method
• Implement one of the introduced decomposition algorithms in an object oriented programming language
• Critique the results of the implemented decomposition algorithm
• Evaluate the strengths and weaknesses of different decomposition methods
• Communicate analyses and results in report form

Programming, Operations Research, linear programming, integer programming, duality, Dantzig-Wolfe decomposition, Benders decomposition TBA N/A 04. maj, 2017