Journal ArticleDOI
Solving two-stage robust optimization problems using a column-and-constraint generation method
TLDR
A computational study on a two-stage robust location-transportation problem shows that the column-and-constraint generation algorithm performs an order of magnitude faster than existing Benders-style cutting plane methods.About:
This article is published in Operations Research Letters.The article was published on 2013-09-01. It has received 1010 citations till now. The article focuses on the topics: Robust optimization & Cutting-plane method.read more
Citations
More filters
Journal Article
An Efficient Approach to Distributionally Robust Network Capacity Planning
TL;DR: An efficient solution algorithm is developed for a network capacity expansion problem in the context of telecommunication networks by characterizing the resulting worst-case two-point distribution, which allows for reformulate the original problem as a convex optimization problem.
Journal ArticleDOI
Robust Bidding Strategy for Multi-Energy Virtual Power Plant in Peak-Regulation Ancillary Service Market Considering Uncertainties
Journal ArticleDOI
Reliability-constrained robust expansion planning of active distribution networks
Posted Content
Market Clearing for Uncertainty, Generation Reserve, and Transmission Reserve--Part II:Case Study
TL;DR: In Part II of this two-part paper, the marginal prices derived in Part I are analyzed within a robust optimization framework and the Financial Transmission Right (FTR) underfunding is demonstrated when there is transmission reserve.
Journal ArticleDOI
An Epistemic Utility-Theoretic Model in Fortifying Oil-and-Gas Production Networks
TL;DR: A tri-level leader–follower–operator game is established for determining the optimal fortification tactics to protect the critical assets considering the petroleum firm limited resources and it is verified that the deception concept is much more effective than fortification.
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
Robust Convex Optimization
Aharon Ben-Tal,Arkadi Nemirovski +1 more
TL;DR: If U is an ellipsoidal uncertainty set, then for some of the most important generic convex optimization problems (linear programming, quadratically constrained programming, semidefinite programming and others) the corresponding robust convex program is either exactly, or approximately, a tractable problem which lends itself to efficientalgorithms such as polynomial time interior point methods.
Journal ArticleDOI
Generalized Benders decomposition
TL;DR: In this paper, the extremal value of the linear program as a function of the parameterizing vector and the set of values of the parametric vector for which the program is feasible were derived using linear programming duality theory.