Functional Sensitivity Analysis Method and Functionally Robust Optimization in Decision-making Under Uncertainty
Author:
Publisher:
Published: 2016
Total Pages: 186
ISBN-13:
DOWNLOAD EBOOKRead and Download eBook Full
Author:
Publisher:
Published: 2016
Total Pages: 186
ISBN-13:
DOWNLOAD EBOOKAuthor: Mian Li
Publisher:
Published: 2007
Total Pages:
ISBN-13:
DOWNLOAD EBOOKAuthor: Jiyoung Im
Publisher:
Published: 2018
Total Pages: 97
ISBN-13:
DOWNLOAD EBOOKIn this thesis, we study the special case of linear optimization to show what may affect the sensitivity of the optimal value function under data uncertainty. In this special case, we show that the robust optimization problem with a locally smaller feasible region yields a more conservative robust optimal value than the one with a locally bigger feasible region. To achieve that goal, we use a geometric approach to analyze the sensitivity of the optimal value function for linear programming (LP) under data uncertainty. We construct a family of proper cones where the strict containment holds for any pair of cones in the family. We then form a family of LP problems using this family of cones constructed above; the feasible regions of each pair of LPs in the family holds strict containment, every LP in the family has the unique optimal solution at the vertex of the cone and has the same objective function, i.e., every LP in the family shares the same optimal solution and the same optimal value. We rewrite he LPs so that they reflect the given data uncertainty and perform local analysis near the optimal solutions where the local strict containment holds. Finally, we illustrate that an LP with a locally smaller feasible region is more sensitive than an LP with a locally bigger feasible region.
Author: Tomas Gal
Publisher: Springer Science & Business Media
Published: 2012-12-06
Total Pages: 595
ISBN-13: 1461561035
DOWNLOAD EBOOKThe standard view of Operations Research/Management Science (OR/MS) dichotomizes the field into deterministic and probabilistic (nondeterministic, stochastic) subfields. This division can be seen by reading the contents page of just about any OR/MS textbook. The mathematical models that help to define OR/MS are usually presented in terms of one subfield or the other. This separation comes about somewhat artificially: academic courses are conveniently subdivided with respect to prerequisites; an initial overview of OR/MS can be presented without requiring knowledge of probability and statistics; text books are conveniently divided into two related semester courses, with deterministic models coming first; academics tend to specialize in one subfield or the other; and practitioners also tend to be expert in a single subfield. But, no matter who is involved in an OR/MS modeling situation (deterministic or probabilistic - academic or practitioner), it is clear that a proper and correct treatment of any problem situation is accomplished only when the analysis cuts across this dichotomy.
Author: Jin Park
Publisher:
Published: 2006
Total Pages: 210
ISBN-13:
DOWNLOAD EBOOKAuthor: Fedor Nazarov
Publisher:
Published: 2023
Total Pages: 0
ISBN-13:
DOWNLOAD EBOOKAuthor: Aharon Ben-Tal
Publisher: Princeton University Press
Published: 2009-08-10
Total Pages: 565
ISBN-13: 1400831059
DOWNLOAD EBOOKRobust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of the subject. Robust optimization is designed to meet some major challenges associated with uncertainty-affected optimization problems: to operate under lack of full information on the nature of uncertainty; to model the problem in a form that can be solved efficiently; and to provide guarantees about the performance of the solution. The book starts with a relatively simple treatment of uncertain linear programming, proceeding with a deep analysis of the interconnections between the construction of appropriate uncertainty sets and the classical chance constraints (probabilistic) approach. It then develops the robust optimization theory for uncertain conic quadratic and semidefinite optimization problems and dynamic (multistage) problems. The theory is supported by numerous examples and computational illustrations. An essential book for anyone working on optimization and decision making under uncertainty, Robust Optimization also makes an ideal graduate textbook on the subject.
Author:
Publisher:
Published: 2021
Total Pages: 96
ISBN-13:
DOWNLOAD EBOOKIn this work, we study decision making with personalized stochastic optimization models. The methods, we propose, develop custom-tailored stochastic optimization models for a specific decision maker, while preserving the robustness of an optimal decision as expressions of the decision maker's attitude towards ambiguity. We present an optimization model using a novel robust preference relationship -- reference-based almost stochastic dominance (RSD). We use decision maker's utility function as a reference to individualize constraints of stochastic dominance. The concept of RSD addresses the two problems in utility-based decision making: (i) ambiguity and inaccuracy in characterizing the decision maker's individual risk attitude, (ii) over-conservativeness of stochastic dominance representing general properties of risk aversion. The RSD rule reveals the maximum dominance level quantifying the robustness of the decision maker's preference between alternative choices. We develop an approximation model using Bernstein polynomials, show the asymptotic convergence of its optimal value and set of optimal solutions to the true counterparts as the degree of Bernstein polynomials increases, and analyze the convergence rate of its feasible region. We next develop a cut-generation algorithm to solve the approximation model. Finally, we further adapt this cut-generation algorithm to seek a valid option most robustly preferable to a random benchmark. The effectiveness and computational complexity of the model are illustrated using a portfolio optimization problem. We study the sensitivity of the personalized stochastic optimization models with regards to risk entangled with the decision maker's ambiguous preference itself. We present a bi-objective stochastic optimization model --expected utility and sensitivity-averse maximization (ESM), incorporating classical risk-aversion and sensitivity analysis with regards to decision maker's preference. Unlike classical sensitivity analysis approaches which are post-analyses after optimization, ESM incorporates sensitivity analysis in the optimization procedure in terms of the second objective function. It thus allows to produce solutions which are both risk-averse in the classical sense and sensitivity-averse with regards to ambiguity in the decision maker's preference. ESM adapts the sensitivity measure (SMU) from the general Bayesian sensitivity analysis to build connection between classical expected utility maximization and the sensitivity aversion. We develop two solution methods of ESM. A mixed-integer reformulation is given for a preference maximizer decision maker, while a linear programming reformulation for a risk-averse decision maker. The effect of ESM is illustrated using a homeland security budget allocation problem.
Author: Miguel A. Goberna
Publisher: Springer Science & Business Media
Published: 2014-01-06
Total Pages: 128
ISBN-13: 148998044X
DOWNLOAD EBOOKPost-Optimal Analysis in Linear Semi-Infinite Optimization examines the following topics in regards to linear semi-infinite optimization: modeling uncertainty, qualitative stability analysis, quantitative stability analysis and sensitivity analysis. Linear semi-infinite optimization (LSIO) deals with linear optimization problems where the dimension of the decision space or the number of constraints is infinite. The authors compare the post-optimal analysis with alternative approaches to uncertain LSIO problems and provide readers with criteria to choose the best way to model a given uncertain LSIO problem depending on the nature and quality of the data along with the available software. This work also contains open problems which readers will find intriguing a challenging. Post-Optimal Analysis in Linear Semi-Infinite Optimization is aimed toward researchers, graduate and post-graduate students of mathematics interested in optimization, parametric optimization and related topics.
Author: Andrea Saltelli
Publisher: John Wiley & Sons
Published: 2000-10-03
Total Pages: 515
ISBN-13: 0471998923
DOWNLOAD EBOOKSensitivity analysis is used to ascertain how a given model output depends upon the input parameters. This is an important method for checking the quality of a given model, as well as a powerful tool for checking the robustness and reliability of its analysis. The topic is acknowledged as essential for good modelling practice, and is an implicit part of any modelling field. · Offers an accessible introduction to sensitivity analysis · Covers all the latest research · Illustrates concepts with numerous examples, applications and case studies · Includes contributions form the leading researchers active in developing strategies for sensitivity analysis The principles of sensitivity analysis area carefully described, and suitable methods for approaching many types of problems are given. The book introduces the modeller to the entire causal assessment chain, from data to predictions, whilst explaining the impact of source uncertainties and framing assumptions. A 'hitch-hiker's guide' is included to allow the more experienced reader to readily access specific applications. Modellers from a wide range of disciplines, including biostatistics, economics, environmental impact assessment, chemistry and engineering will benefit greatly form the numerous examples and applications.