Sökning: "recovery of primal solutions"

Hittade 1 uppsats innehållade orden recovery of primal solutions.

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

    Master-uppsats, Göteborgs universitet/Institutionen för matematiska vetenskaper

    Författare :Pauline Aldenvik; Mirjam Schierscher; [2015-10-06]
    Nyckelord :Branch-and-bound method; subgradient method; Lagrangian dual; recovery of primal solutions; ergodic sequence; mixed binary linear programming; set covering; facility location;

    Sammanfattning : 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. LÄS MER