GUPEA >
Student essays / Studentuppsatser >
Department of Mathematical Sciences / Institutionen för matematiska vetenskaper >
Masteruppsatser >

Recovery of primal solutions from dual subgradient methods for mixed binary linear programming; a branch-and-bound approach


Please use this identifier to cite or link to this item: http://hdl.handle.net/2077/40726

Files in This Item:

File Description SizeFormat
gupea_2077_40726_1.pdf804KbAdobe PDF
View/Open
Title: Recovery of primal solutions from dual subgradient methods for mixed binary linear programming; a branch-and-bound approach
Authors: Aldenvik, Pauline
Schierscher, Mirjam
Issue Date: 6-Oct-2015
Degree: Student essay
Keywords: Branch-and-bound method
subgradient method
Lagrangian dual
recovery of primal solutions
ergodic sequence
mixed binary linear programming
set covering
facility location
Abstract: The main objective of this thesis is to implement and evaluate a Lagrangian heuristic and a branch-and-bound algorithm for solving a class of mathematical optimization problems called mixed binary linear programs. The tests are performed on two different types of mixed binary linear programs: the set covering problem and the (uncapacitated as well as capacitated) facility location problem. The purpose is to investigate a concept rather than trying to achieve good runtime performance. The ... more
URI: http://hdl.handle.net/2077/40726
Appears in Collections:Masteruppsatser

 

 

© Göteborgs universitet 2011