382 research outputs found
Theory and Applications of Robust Optimization
In this paper we survey the primary research, both theoretical and applied,
in the area of Robust Optimization (RO). Our focus is on the computational
attractiveness of RO approaches, as well as the modeling power and broad
applicability of the methodology. In addition to surveying prominent
theoretical results of RO, we also present some recent results linking RO to
adaptable models for multi-stage decision-making problems. Finally, we
highlight applications of RO across a wide spectrum of domains, including
finance, statistics, learning, and various areas of engineering.Comment: 50 page
Robust optimization with incremental recourse
In this paper, we consider an adaptive approach to address optimization
problems with uncertain cost parameters. Here, the decision maker selects an
initial decision, observes the realization of the uncertain cost parameters,
and then is permitted to modify the initial decision. We treat the uncertainty
using the framework of robust optimization in which uncertain parameters lie
within a given set. The decision maker optimizes so as to develop the best cost
guarantee in terms of the worst-case analysis. The recourse decision is
``incremental"; that is, the decision maker is permitted to change the initial
solution by a small fixed amount. We refer to the resulting problem as the
robust incremental problem. We study robust incremental variants of several
optimization problems. We show that the robust incremental counterpart of a
linear program is itself a linear program if the uncertainty set is polyhedral.
Hence, it is solvable in polynomial time. We establish the NP-hardness for
robust incremental linear programming for the case of a discrete uncertainty
set. We show that the robust incremental shortest path problem is NP-complete
when costs are chosen from a polyhedral uncertainty set, even in the case that
only one new arc may be added to the initial path. We also address the
complexity of several special cases of the robust incremental shortest path
problem and the robust incremental minimum spanning tree problem
Determining a Robust, Pareto Optimal Geometry for a Welded Joint
Multi-criteria optimization problems are known to give rise to a set of Pareto optimal solutions where one solution cannot be regarded as being superior to another. It is often stated that the selection of a particular solution from this set should be based on additional criteria. In this paper a methodology has been proposed that allows a robust design to be selected from the Pareto optimal set. This methodology has been used to determine a robust geometry for a welded joint. It has been shown that the robust geometry is dependent on the variability of the geometric parameters
Seven Sins in Portfolio Optimization
Although modern portfolio theory has been in existence for over 60 years,
fund managers often struggle to get its models to produce reliable portfolio
allocations without strongly constraining the decision vector by tight bands of
strategic allocation targets. The two main root causes to this problem are
inadequate parameter estimation and numerical artifacts. When both obstacles
are overcome, portfolio models yield excellent allocations. In this paper,
which is primarily aimed at practitioners, we discuss the most common mistakes
in setting up portfolio models and in solving them algorithmically
Inventory routing problem with non-stationary stochastic demands
In this paper we solve Stochastic Periodic Inventory Routing Problem (SPIRP) when the accuracy of expected demand is changing among the periods. The variability of demands increases from period to period. This variability follows a certain rate of uncertainty. The uncertainty rate shows the change in accuracy level of demands during the planning horizon. To deal with the growing uncertainty, we apply a safety stock based SPIRP model with different levels of safety stock. To satisfy the service level in the whole planning horizon, the level of safety stock needs to be adjusted according to the demand's variability. In addition, the behavior of the solution model in long term planning horizons for retailers with different demand accuracy is taken into account. We develop the SPIRP model for one retailer with an average level of demand, and standard deviation for each period. The objective is to find an optimum level of safety stock to be allocated to the retailer, in order to achieve the expected level of service, and minimize the costs. We propose a model to deal with the uncertainty in demands, and evaluate the performance of the model based on the defined indicators and experimentally designed cases
- …