نتایج جستجو برای: robust optimization

تعداد نتایج: 509147  

Journal: :Environmental Modelling and Software 2009
Gunhui Chung Kevin Lansey Güzin Bayraksan

Given the natural variability and uncertainties in long-term predictions, reliability is a critical design factor for water supply systems. However, the large scale of the problem and the correlated nature of the involved uncertainties result in models that are often intractable. In this paper, we consider a municipal water supply system over a 15-year planning period with initial infrastructur...

2008
Michele Monaci

We consider optimization problems where the exact value of the input data is not known in advance and can be affected by uncertainty. For these problems, one is typically required to determine a robust solution, i.e., a possibly suboptimal solution whose feasibility and cost is not affected heavily by the change of certain input coefficients. Two main classes of models have been proposed in the...

2014
Amadeu Almeida Coco Elyn L. Solano-Charris Andréa Cynthia Santos Christian Prins Thiago Noronha

Uncertain parameters appear in many optimization problems raised by real-world applications. To handle such problems, several approaches to model uncertainty are available, such as stochastic programming and robust optimization. This study is focused on robust optimization, in particular, the criteria to select and determine a robust solution. We provide an overview on robust optimization crite...

2011
Grit Claßen Arie M. C. A. Koster Anke Schmeink

An optimal planning of future wireless networks is fundamental to satisfy rising traffic demands jointly with the utilization of sophisticated techniques, such as OFDMA. Current methods for this task require a static model of the problem. However, uncertainty of data arises frequently in wireless networks, e. g., fluctuating bit rate requirements. In this paper, robust optimization is applied t...

2013
Christina Büsing Fabio D'Andreagiovanni Annie Raymond

We provide an overview of new theoretical results that we obtained while further investigating multiband robust optimization, a new model for robust optimization that we recently proposed to tackle uncertainty in mixed-integer linear programming. This new model extends and refines the classical Γ -robustness model of Bertsimas and Sim and is particularly useful in the common case of arbitrary a...

2009
Suat Gumussoy Didier Henrion Marc Millstone Michael L. Overton

Multiobjective control design is known to be a difficult problem both in theory and practice. Our approach is to search for locally optimal solutions of a nonsmooth optimization problem that is built to incorporate minimization objectives and constraints for multiple plants. We report on the success of this approach using our public-domain matlab toolbox hifoo 2.0, comparing our results with be...

Journal: :CoRR 2014
Theja Tulabandhula Cynthia Rudin

Our goal is to build robust optimization problems for making decisions based on complex data from the past. In robust optimization (RO) generally, the goal is to create a policy for decision-making that is robust to our uncertainty about the future. In particular, we want our policy to best handle the the worst possible situation that could arise, out of an uncertainty set of possible situation...

2012
S. Tréfond H. Djellab E. Escobar A. Billionnet S. Elloumi

This paper deals with an investigation of combinatorial and robust optimization models to solve rolling-stock planning problems for passenger trains. Here robustness means that rolling-stock can better deal with some disruptions of the railway system. The proposed method is based on optimization and simulation techniques to handle the problem with imperfect information on data. The goal of the ...

2014
Vishal Gupta Nathan Kallus Dimitris Bertsimas

Abstract Sample average approximation (SAA) is a widely popular approach to data-driven decisionmaking under uncertainty. Under mild assumptions, SAA is both tractable and enjoys strong asymptotic performance guarantees. Similar guarantees, however, do not typically hold in finite samples. In this paper, we propose a modification of SAA, which we term Robust SAA, which retains SAA’s tractabilit...

2013
Haobo Fu Bernhard Sendhoff Ke Tang Xin Yao

Most research in evolutionary dynamic optimization is based on the assumption that the primary goal in solving Dynamic Optimization Problems (DOPs) is Tracking Moving Optimum (TMO). Yet, TMO is impractical in cases where keeping changing solutions in use is impossible. To solve DOPs more practically, a new formulation of DOPs was proposed recently, which is referred to as Robust Optimization Ov...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید