Show simple item record

dc.contributor.authorPunjwani, Shahroz 15:18:53 (GMT) 15:18:53 (GMT)
dc.description.abstractLagrangian relaxation is a widely used decomposition approach to solve difficult optimization problems that exhibit special structure. It provides a lower bound on the optimal objective of a minimization problem. On the other hand, an upper bound and quality feasible solutions may be obtained by perturbing solutions of the subproblem. In this thesis, we enhance the Lagrangian approach by using information at the subproblem to push for feasibility to the original problem. We exploit the idea that if the solution for the subproblem is pushed towards feasibility to the original problem, it may lead to improved lower bounds as well as good feasible solutions. Our proposed strategy is to solve the subproblem repeatedly at each iteration of the Lagrangian procedure and strengthen it with valid inequalities. As cuts are added to the subproblem, it inevitably becomes harder to solve. We propose to solve it under a time limit and adjust the Lagrangian bound accordingly. Two variants of the approach are explored that we call a Modified Lagrangian approach and a Feasible Lagrangian approach. We use the Generalized Assignment Problem for testing. We develop two methodologies based on minimal covering inequalities. The first solves the subproblem repeatedly for a given number of iterations and generates minimal cover inequalities that are either discarded or passed on to subsequent Lagrangian iterations. The second starts with initial multipliers and repeatedly solves the subproblem until a feasible solution is attained. At that point, the regular Lagrangian approach is used to find a lower bound. We test on GAP instances from the literature and compare the lower bound to the Lagrangian bound and the feasible solution to the best known solution in the literature. The results demonstrate that the proposed feasible Lagrangian approach leads to improved lower bounds and good quality feasible solutions.en
dc.publisherUniversity of Waterlooen
dc.subjectFeasible Lagrangian Approachen
dc.subjectGeneralized Assignment Problemen
dc.titleA Feasible Lagrangian Approach with Application to the Generalized Assignment Problemen
dc.typeMaster Thesisen
dc.pendingfalse Sciencesen Sciencesen of Waterlooen
uws-etd.degreeMaster of Applied Scienceen
uws.contributor.advisorGzara, Fatma
uws.contributor.advisorElhedhli, Samir
uws.contributor.affiliation1Faculty of Engineeringen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages