Month: April 2016

A Hybrid Discretization Algorithm with Guaranteed Feasibility for the Global Solution of Semi-Infinite Programs

  • Hatim Djelassi
  • Alexander Mitsos
    • Categories Semi-infinite Programming

    A discretization-based algorithm for the global solution of semi-infinite programs (SIPs) is proposed, which is guaranteed to converge to a feasible, ε-optimal solution finitely under mild assumptions. The algorithm is based on the hybridization of two existing algorithms. The first algorithm (Mitsos in Optimization 60(10–11):1291–1308, 2011) is based on a restriction of the right-hand side … Read more

    Lagrangian and Branch-and-Cut Approaches for Upgrading Spanning Tree Problems

  • Eduardo Alvarez-Miranda
  • Markus Sinnl
    • Categories Branch and Cut Algorithms, Network Optimization, Telecommunications

    Problems aiming at finding budget constrained optimal upgrading schemes to improve network performance have received attention over the last two decades. In their general setting, these problems consist of designing a network and, simultaneously, allocating (limited) upgrading resources in order to enhance the performance of the designed network. In this paper we address two particular … Read more