Be the first to like this
My term project report for my Applied Optimization course. I proposed to examine the application of Lagrangian Relaxation and Danzig-Wolfe Decomposition techniques to the Generalized Assignment Problem. I both presented the formulations and compared the different methods in terms of the solve time metric for cases of varying complexity.
The Generalized Assignment Problem is a mixed-integer problem and a superset of the Scheduling Problem.