共查询到20条相似文献,搜索用时 62 毫秒
1.
《Operations Research Letters》2019,47(5):452-457
We consider robust assortment optimization problems with partial distributional information of parameters in the multinomial logit choice model. The objective is to find an assortment that maximizes a revenue target using a distributionally robust chance constraint, which can be approximated by the worst-case Conditional Value-at-Risk. We show that our problems are equivalent to robust assortment optimization problems over special uncertainty sets of parameters, implying the optimality of revenue-ordered assortments under certain conditions. 相似文献
2.
In this paper, we propose an approximate optimization model for the robust second-order-cone programming problem with a single-ellipsoid uncertainty set for which the computational complexity is not known yet. We prove that this approximate robust model can be equivalently reformulated as a finite convex optimization problem. 相似文献
3.
《Optimization》2012,61(7):1099-1116
In this article we study support vector machine (SVM) classifiers in the face of uncertain knowledge sets and show how data uncertainty in knowledge sets can be treated in SVM classification by employing robust optimization. We present knowledge-based SVM classifiers with uncertain knowledge sets using convex quadratic optimization duality. We show that the knowledge-based SVM, where prior knowledge is in the form of uncertain linear constraints, results in an uncertain convex optimization problem with a set containment constraint. Using a new extension of Farkas' lemma, we reformulate the robust counterpart of the uncertain convex optimization problem in the case of interval uncertainty as a convex quadratic optimization problem. We then reformulate the resulting convex optimization problems as a simple quadratic optimization problem with non-negativity constraints using the Lagrange duality. We obtain the solution of the converted problem by a fixed point iterative algorithm and establish the convergence of the algorithm. We finally present some preliminary results of our computational experiments of the method. 相似文献
4.
A previous approach to robust intensity-modulated radiation therapy (IMRT) treatment planning for moving tumors in the lung involves solving a single planning problem before the start of treatment and using the resulting solution in all of the subsequent treatment sessions. In this paper, we develop an adaptive robust optimization approach to IMRT treatment planning for lung cancer, where information gathered in prior treatment sessions is used to update the uncertainty set and guide the reoptimization of the treatment for the next session. Such an approach allows for the estimate of the uncertain effect to improve as the treatment goes on and represents a generalization of existing robust optimization and adaptive radiation therapy methodologies. Our method is computationally tractable, as it involves solving a sequence of linear optimization problems. We present computational results for a lung cancer patient case and show that using our adaptive robust method, it is possible to attain an improvement over the traditional robust approach in both tumor coverage and organ sparing simultaneously. We also prove that under certain conditions our adaptive robust method is asymptotically optimal, which provides insight into the performance observed in our computational study. The essence of our method – solving a sequence of single-stage robust optimization problems, with the uncertainty set updated each time – can potentially be applied to other problems that involve multi-stage decisions to be made under uncertainty. 相似文献
5.
In robust optimization, the general aim is to find a solution that performs well over a set of possible parameter outcomes, the so-called uncertainty set. In this paper, we assume that the uncertainty size is not fixed, and instead aim at finding a set of robust solutions that covers all possible uncertainty set outcomes. We refer to these problems as robust optimization with variable-sized uncertainty. We discuss how to construct smallest possible sets of min–max robust solutions and give bounds on their size.A special case of this perspective is to analyze for which uncertainty sets a nominal solution ceases to be a robust solution, which amounts to an inverse robust optimization problem. We consider this problem with a min–max regret objective and present mixed-integer linear programming formulations that can be applied to construct suitable uncertainty sets.Results on both variable-sized uncertainty and inverse problems are further supported with experimental data. 相似文献
6.
In real-world applications of optimization, optimal solutions are often of limited value, because disturbances of or changes to input data may diminish the quality of an optimal solution or even render it infeasible. One way to deal with uncertain input data is robust optimization, the aim of which is to find solutions which remain feasible and of good quality for all possible scenarios, i.e., realizations of the uncertain data. For single objective optimization, several definitions of robustness have been thoroughly analyzed and robust optimization methods have been developed. In this paper, we extend the concept of minmax robustness (Ben-Tal, Ghaoui, & Nemirovski, 2009) to multi-objective optimization and call this extension robust efficiency for uncertain multi-objective optimization problems. We use ingredients from robust (single objective) and (deterministic) multi-objective optimization to gain insight into the new area of robust multi-objective optimization. We analyze the new concept and discuss how robust solutions of multi-objective optimization problems may be computed. To this end, we use techniques from both robust (single objective) and (deterministic) multi-objective optimization. The new concepts are illustrated with some linear and quadratic programming instances. 相似文献
7.
Optimization models are increasingly being used in agricultural planning. However, the inherent uncertainties present in agriculture make it difficult. In recent years, robust optimization has emerged as a methodology that allows dealing with uncertainty in optimization models, even when probabilistic knowledge of the phenomenon is incomplete. In this paper, we consider a wine grape harvesting scheduling optimization problem subject to several uncertainties, such as the actual productivity that can be achieved when harvesting. We study how effective robust optimization is solving this problem in practice. We develop alternative robust models and show results for some test problems obtained from actual wine industry problems. 相似文献
8.
Nalan Gülpınar Dessislava Pachamanova Ethem Çanakoğlu 《European Journal of Operational Research》2013
This paper considers a stochastic facility location problem in which multiple capacitated facilities serve customers with a single product, and a stockout probabilistic requirement is stated as a chance constraint. Customer demand is assumed to be uncertain and to follow either a normal or an ambiguous distribution. We study robust approximations to the problem in order to incorporate information about the random demand distribution in the best possible, computationally tractable way. We also discuss how a decision maker’s risk preferences can be incorporated in the problem through robust optimization. Finally, we present numerical experiments that illustrate the performance of the different robust formulations. Robust optimization strategies for facility location appear to have better worst-case performance than nonrobust strategies. They also outperform nonrobust strategies in terms of realized average total cost when the actual demand distributions have higher expected values than the expected values used as input to the optimization models. 相似文献
9.
In this article, we investigate robust optimization equilibria with two players, in which each player can neither evaluate his opponent's strategy nor his own cost matrix accurately while may estimate a bounded set of the strategy or cost matrix. We obtain a result that solving this equilibria can be formulated as solving a second-order cone complementarity problem under an ellipsoid uncertainty set or a mixed complementarity problem under a box uncertainty set. We present some numerical results to illustrate the behaviour of robust optimization equilibria. 相似文献
10.
This paper provides an overview of developments in robust optimization since 2007. It seeks to give a representative picture of the research topics most explored in recent years, highlight common themes in the investigations of independent research teams and highlight the contributions of rising as well as established researchers both to the theory of robust optimization and its practice. With respect to the theory of robust optimization, this paper reviews recent results on the cases without and with recourse, i.e., the static and dynamic settings, as well as the connection with stochastic optimization and risk theory, the concept of distributionally robust optimization, and findings in robust nonlinear optimization. With respect to the practice of robust optimization, we consider a broad spectrum of applications, in particular inventory and logistics, finance, revenue management, but also queueing networks, machine learning, energy systems and the public good. Key developments in the period from 2007 to present include: (i) an extensive body of work on robust decision-making under uncertainty with uncertain distributions, i.e., “robustifying” stochastic optimization, (ii) a greater connection with decision sciences by linking uncertainty sets to risk theory, (iii) further results on nonlinear optimization and sequential decision-making and (iv) besides more work on established families of examples such as robust inventory and revenue management, the addition to the robust optimization literature of new application areas, especially energy systems and the public good. 相似文献
11.
《European Journal of Operational Research》2020,280(2):539-554
Optimization models for long-term energy planning often feature many uncertain inputs, which can be handled using robust optimization. However, uncertainty is seldom accounted for in the energy planning practice, and robust optimization applications in this field normally consider only a few uncertain parameters. A reason for this gap between energy practice and stochastic modeling is that large-scale energy models often present features—such as multiplied uncertain parameters in the objective and many uncertainties in the constraints—which make it difficult to develop generalized and tractable robust formulations. In this paper, we address these limiting features to provide a complete robust optimization framework allowing the consideration of all uncertain parameters in energy models. We also introduce an original approach to make use of the obtained robust formulations for decision support and provide a case study of a national energy system for validation. 相似文献
12.
Modelling of convex optimization in the face of data uncertainty often gives rise to families of parametric convex optimization problems. This motivates us to present, in this paper, a duality framework for a family of parametric convex optimization problems. By employing conjugate analysis, we present robust duality for the family of parametric problems by establishing strong duality between associated dual pair. We first show that robust duality holds whenever a constraint qualification holds. We then show that this constraint qualification is also necessary for robust duality in the sense that the constraint qualification holds if and only if robust duality holds for every linear perturbation of the objective function. As an application, we obtain a robust duality theorem for the best approximation problems with constraint data uncertainty under a strict feasibility condition. 相似文献
13.
Computational Management Science - We consider a general robust block-structured optimization problem, coming from applications in network and energy optimization. We propose and study an iterative... 相似文献
14.
15.
《Optimization》2012,61(2):187-207
This article presents a robust optimization formulation for dealing with production cost uncertainty in an oligopolistic market scenario. It is not uncommon that players in the market face an equilibrium selling price but uncertain production costs. We show that, based on a nominal problem, the robust optimization formulation can be derived as a variational inequality with control and state variables. This convenient approach may be applied for computing optimal solutions efficiently, which help manufacturers dramatically and rapidly reform production and distribution schedules such that they can compete in the market successfully. 相似文献
16.
Organic Rankine Cycle (ORC) turbines usually operate in thermodynamic regions characterized by high-pressure ratios and strong non-ideal gas effects, complicating the aerodynamic design significantly. Systematic optimization methods accounting for multiple uncertainties due to variable operating conditions, referred to as Robust Optimization may benefit to ORC turbines aerodynamic design. This study presents an original and fast robust shape optimization approach to overcome the limitation of a deterministic optimization that neglects operating conditions variability, applied to a well-known supersonic turbine nozzle for ORC applications. The flow around the blade is assumed inviscid and adiabatic and it is reconstructed using the open-source SU2 code. The non-ideal gasdynamics is modeled through the Peng-Robinson-Stryjek-Vera equation of state. We propose here a mono-objective formulation which consists in minimizing the α-quantile of the targeted Quantity of Interest (QoI) under a probabilistic constraint, at a low computational cost. This problem is solved by using an efficient robust optimization approach, coupling a state-of-the-art quantile estimation and a classical Bayesian optimization method. First, the advantages of a quantile-based formulation are illustrated with respect to a conventional mean-based robust optimization. Secondly, we demonstrate the effectiveness of applying this robust optimization framework with a low-fidelity inviscid solver by comparing the resulting optimal design with the ones obtained with a deterministic optimization using a fully turbulent solver. 相似文献
17.
In this paper, we consider robust optimal solutions for a convex optimization problem in the face of data uncertainty both in the objective and constraints. By using the properties of the subdifferential sum formulae, we first introduce a robust-type subdifferential constraint qualification, and then obtain some completely characterizations of the robust optimal solution of this uncertain convex optimization problem. We also investigate Wolfe type robust duality between the uncertain convex optimization problem and its uncertain dual problem by proving duality between the deterministic robust counterpart of the primal model and the optimistic counterpart of its dual problem. Moreover, we show that our results encompass as special cases some optimization problems considered in the recent literature. 相似文献
18.
19.
Alexander Shapiro 《Operations Research Letters》2011,39(2):83-87
In this paper we consider the adjustable robust approach to multistage optimization, for which we derive dynamic programming equations. We also discuss this from the point of view of risk averse stochastic programming. We consider as an example a robust formulation of the classical inventory model and show that, like for the risk neutral case, a basestock policy is optimal. 相似文献
20.
Christine Gregory Ken Darby-DowmanGautam Mitra 《European Journal of Operational Research》2011,212(2):417-428
Robust optimization is a tractable alternative to stochastic programming particularly suited for problems in which parameter values are unknown, variable and their distributions are uncertain. We evaluate the cost of robustness for the robust counterpart to the maximum return portfolio optimization problem. The uncertainty of asset returns is modelled by polyhedral uncertainty sets as opposed to the earlier proposed ellipsoidal sets. We derive the robust model from a min-regret perspective and examine the properties of robust models with respect to portfolio composition. We investigate the effect of different definitions of the bounds on the uncertainty sets and show that robust models yield well diversified portfolios, in terms of the number of assets and asset weights. 相似文献