Affine recourse for the robust network design problem: Between static and dynamic routing
TLDR
It is shown that affine routing can be seen as a generalization of the widely used static routing while still being tractable and providing cheaper solutions and that for these instances the optimal solutions based on affine routings tend to be as cheap as optimal network designs for dynamic routings.Abstract:
Affinely Adjustable Robust Counterparts provide tractable alternatives to (two-stage) robust programs with arbitrary recourse. Following Ouorou and Vial, we apply them to robust network design with polyhedral demand uncertainty, introducing the notion of affine routing. We compare the new affine routing scheme to the well-studied static and dynamic routing schemes for robust network design. It is shown that affine routing can be seen as a generalization of the widely used static routing while still being tractable and providing cheaper solutions. We investigate properties of the demand polytope under which affine routings reduce to static routings and also develop conditions on the uncertainty set leading to dynamic routings being affine. We show however that affine routings suffer from the drawback that (even totally) dominated demand vectors are not necessarily supported by affine solutions. Uncertainty sets have to be designed accordingly. Finally, we present computational results on networks from SNDlib. We conclude that for these instances the optimal solutions based on affine routings tend to be as cheap as optimal network designs for dynamic routings. In this respect the affine routing principle can be used to approximate the cost for two-stage solutions with free recourse which are hard to computeread more
Citations
More filters
Journal ArticleDOI
A Distributed Method for Optimal Capacity Reservation
TL;DR: In this article, the authors consider the problem of reserving link capacity in a network in such a way that any of a given set of flow scenarios can be supported, and develop a scalable, distributed algorithm that alternates between solving (in parallel) one-flow problem per scenario, and coordination steps, which connect the individual flows and the reservation capacities.
Posted Content
Robust Minimum Cost Flow Problem Under Consistent Flow Constraints.
TL;DR: Structural results are derived which point out the differences with the polynomial time solvable MCF problem in networks with integral demands, supplies, and capacities and propose a pseudo-polynomial algorithm based on dynamic programming.
Journal ArticleDOI
A polyhedral analysis of the capacitated edge activation problem with uncertain demands
DissertationDOI
Optimization under uncertainty: conic programming representations, relaxations, and approximations
TL;DR: This thesis examines, improves, and combines the latter two paradigms of stochastic programming, robust optimization, and sensitivity analysis in several relevant models and applications, and proposes a framework for sensitivity analysis of LP problems, allowing for simultaneous perturbations in the objective coefficients and right-hand sides.
References
More filters
Journal ArticleDOI
The Price of Robustness
Dimitris Bertsimas,Melvyn Sim +1 more
TL;DR: In this paper, the authors propose an approach that attempts to make this trade-off more attractive by flexibly adjusting the level of conservatism of the robust solutions in terms of probabilistic bounds of constraint violations.
The price of the robustness
D Bertsimas,M Sim +1 more
TL;DR: An approach is proposed that flexibly adjust the level of conservatism of the robust solutions in terms of probabilistic bounds of constraint violations, and an attractive aspect of this method is that the new robust formulation is also a linear optimization problem, so it naturally extend to discrete optimization problems in a tractable way.
Journal ArticleDOI
Partitioning procedures for solving mixed-variables programming problems
TL;DR: In this article, the 8th International Meeting of the Institute of Management Sciences, Brussels, August 23-26, 1961, the authors presented a paper entitled "The International Journal of Management Science and Management Sciences".
Journal ArticleDOI
Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
TL;DR: This note formulates a convex mathematical programming problem in which the usual definition of the feasible region is replaced by a significantly different strategy via set containment.
Journal ArticleDOI
Robust solutions of uncertain linear programs
Aharon Ben-Tal,Arkadi Nemirovski +1 more
TL;DR: It is shown that the RC of an LP with ellipsoidal uncertainty set is computationally tractable, since it leads to a conic quadratic program, which can be solved in polynomial time.