On Two-Stage Convex Chance Constrained Problems PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download On Two-Stage Convex Chance Constrained Problems PDF full book. Access full book title On Two-Stage Convex Chance Constrained Problems by . Download full books in PDF and EPUB format.
Author:
Publisher:
ISBN:
Category :
Languages : en
Pages : 26
Get Book Here
Book Description
In this paper we develop approximation algorithms for two-stage convex chance constrained problems. Nemirovski and Shapiro [18] formulated this class of problems and proposed an ellipsoid-like iterative algorithm for the special case where the impact function f "x, h" is bi-affine. We show that this algorithm extends to bi-convex f "x, h" in a fairly straightforward fashion. The complexity of the solution algorithm as well as the quality of its output are functions of the radius r of the largest Euclidean ball that can be inscribed in the polytope defined by a random set of linear inequalities generated by the algorithm [18]. Since the polytope determining r is random, computing r is difficult. Yet, the solution algorithm requires r as an input. In this paper we provide some guidance for selecting r. We show that the largest value of r is determined by the degree of robust feasibility of the two-stage chance constrained problem - the more robust the problem, the higher one can set the parameter r. Next, we formulate ambiguous two-stage chance constrained problems. In this formulation the random variables defining the chance constraint are known to have a fixed distribution; however, the decision maker is only able to estimate this distribution to within some error. We construct an algorithm that solves the ambiguous two-stage chance constrained problem when the impact function f "x, h" is bi-affine and the extreme points of a certain "dual" polytope are known explicitly.
Author:
Publisher:
ISBN:
Category :
Languages : en
Pages : 26
Get Book Here
Book Description
In this paper we develop approximation algorithms for two-stage convex chance constrained problems. Nemirovski and Shapiro [18] formulated this class of problems and proposed an ellipsoid-like iterative algorithm for the special case where the impact function f "x, h" is bi-affine. We show that this algorithm extends to bi-convex f "x, h" in a fairly straightforward fashion. The complexity of the solution algorithm as well as the quality of its output are functions of the radius r of the largest Euclidean ball that can be inscribed in the polytope defined by a random set of linear inequalities generated by the algorithm [18]. Since the polytope determining r is random, computing r is difficult. Yet, the solution algorithm requires r as an input. In this paper we provide some guidance for selecting r. We show that the largest value of r is determined by the degree of robust feasibility of the two-stage chance constrained problem - the more robust the problem, the higher one can set the parameter r. Next, we formulate ambiguous two-stage chance constrained problems. In this formulation the random variables defining the chance constraint are known to have a fixed distribution; however, the decision maker is only able to estimate this distribution to within some error. We construct an algorithm that solves the ambiguous two-stage chance constrained problem when the impact function f "x, h" is bi-affine and the extreme points of a certain "dual" polytope are known explicitly.
Author:
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Get Book Here
Book Description
In this paper we develop approximation algorithms for two-stage convex chance constrained problems. Nemirovski and Shapiro [18] formulated this class of problems and proposed an ellipsoid-like iterative algorithm for the special case where the impact function f "x, h" is bi-affine. We show that this algorithm extends to bi-convex f "x, h" in a fairly straightforward fashion. The complexity of the solution algorithm as well as the quality of its output are functions of the radius r of the largest Euclidean ball that can be inscribed in the polytope defined by a random set of linear inequalities generated by the algorithm [18]. Since the polytope determining r is random, computing r is difficult. Yet, the solution algorithm requires r as an input. In this paper we provide some guidance for selecting r. We show that the largest value of r is determined by the degree of robust feasibility of the two-stage chance constrained problem - the more robust the problem, the higher one can set the parameter r. Next, we formulate ambiguous two-stage chance constrained problems. In this formulation the random variables defining the chance constraint are known to have a fixed distribution; however, the decision maker is only able to estimate this distribution to within some error. We construct an algorithm that solves the ambiguous two-stage chance constrained problem when the impact function f "x, h" is bi-affine and the extreme points of a certain "dual" polytope are known explicitly.
Author: V. Jeyakumar
Publisher: Springer Science & Business Media
ISBN: 9780387267692
Category : Business & Economics
Languages : en
Pages : 476
Get Book Here
Book Description
The search for the best possible performance is inherent in human nature. Individuals, enterprises and governments all seek optimal—that is, the best—possible solutions of problems that they meet. Evidently, continuous optimization plays an increasingly significant role in everyday management and technical decisions in science, engineering and commerce. The collection of 16 refereed papers in this book covers a diverse number of topics and provides a good picture of recent research in continuous optimization. The first part of the book presents substantive survey articles in a number of important topic areas of continuous optimization. Most of the papers in the second part present results on the theoretical aspects as well as numerical methods of continuous optimization. The papers in the third part are mainly concerned with applications of continuous optimization. Hence, the book will be an additional valuable source of information to faculty, students, and researchers who use continuous optimization to model and solve problems. Audience This book is intended for researchers in mathematical programming, optimization and operations research; engineers in various fields; and graduate students in applied mathematics, engineering and operations research.
Author: Alexander Shapiro
Publisher: SIAM
ISBN: 0898718759
Category : Mathematics
Languages : en
Pages : 447
Get Book Here
Book Description
Optimization problems involving stochastic models occur in almost all areas of science and engineering, such as telecommunications, medicine, and finance. Their existence compels a need for rigorous ways of formulating, analyzing, and solving such problems. This book focuses on optimization problems involving uncertain parameters and covers the theoretical foundations and recent advances in areas where stochastic models are available. Readers will find coverage of the basic concepts of modeling these problems, including recourse actions and the nonanticipativity principle. The book also includes the theory of two-stage and multistage stochastic programming problems; the current state of the theory on chance (probabilistic) constraints, including the structure of the problems, optimality theory, and duality; and statistical inference in and risk-averse approaches to stochastic programming.
Author: John R. Birge, Hengyong Tang
Publisher:
ISBN:
Category :
Languages : en
Pages : 10
Get Book Here
Book Description
Author: V.V. Kolbin
Publisher: Springer Science & Business Media
ISBN: 9789027707505
Category : Computers
Languages : en
Pages : 218
Get Book Here
Book Description
This book is devoted to the problems of stochastic (or probabilistic) programming. The author took as his basis the specialized lectures which he delivered to the graduates from the economic cybernetics department of Leningrad University beginning in 1967. Since 1971 the author has delivered a specialized course on Stochastic Programming to the gradu ates from the faculty of applied mathematics/management processes at Leningrad University. The present monograph consists of seven chapters. In Chapter I, which is of an introductory character, consideration is given to the problems of uncertainty and probability, used for modelling complicated systems. Fundamental indications for the classification of stochastic pro gramming problems are given. Chapter II is devoted to the analysis of various models of chance-constrained stochastic programming problems. Examples of technological and applied economic problems of management with chance-constraints are given. In Chapter III two-stage stochastic programming problems are investigated, various models are given, and these models are qualitatively analyzed. In the conclusion of the chapter consideration is given to: the transport problem with random data, the problem of the determination of production volume, and the problem of planning the flights of aircraft as two-stage stochastic programming problems. Multi-stage stochastic programming problems are investigated in Chapter IV. The dependencies between prior and posterior decision rules and decision distributions are given. Dual problems are investigated.
Author: S. Vajda
Publisher: Academic Press
ISBN: 1483268373
Category : Mathematics
Languages : en
Pages : 140
Get Book Here
Book Description
Probabilistic Programming discusses a high-level language known as probabilistic programming. This book consists of three chapters. Chapter I deals with "wait-and-see problems that require waiting until an observation is made on the random elements, while Chapter II contains the analysis of decision problems, particularly of so-called two-stage problems. The last chapter focuses on "chance constraints, such as constraints that are not expected to be always satisfied, but only in a proportion of cases or "with given probabilities. This text specifically deliberates the decision regions for optimality, probability distributions, Kall's Theorem, and two-stage programming under uncertainty. The complete problem, active approach, quantile rules, randomized decisions, and nonzero order rules are also covered. This publication is suitable for developers aiming to define and automatically solve probability models.
Author: Alexander Shapiro
Publisher: SIAM
ISBN: 1611973422
Category : Mathematics
Languages : en
Pages : 512
Get Book Here
Book Description
Optimization problems involving stochastic models occur in almost all areas of science and engineering, such as telecommunications, medicine, and finance. Their existence compels a need for rigorous ways of formulating, analyzing, and solving such problems. This book focuses on optimization problems involving uncertain parameters and covers the theoretical foundations and recent advances in areas where stochastic models are available.? In?Lectures on Stochastic Programming: Modeling and Theory, Second Edition, the authors introduce new material to reflect recent developments in stochastic programming, including: an analytical description of the tangent and normal cones of chance constrained sets; analysis of optimality conditions applied to nonconvex problems; a discussion of the stochastic dual dynamic programming method; an extended discussion of law invariant coherent risk measures and their Kusuoka representations; and in-depth analysis of dynamic risk measures and concepts of time consistency, including several new results.?
Author: Stephen P. Boyd
Publisher: Cambridge University Press
ISBN: 9780521833783
Category : Business & Economics
Languages : en
Pages : 744
Get Book Here
Book Description
Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.
Author: Friedrich Eisenbrand
Publisher: Springer Science & Business Media
ISBN: 3642130356
Category : Computers
Languages : en
Pages : 476
Get Book Here
Book Description
This book constitutes the proceedings of the 14th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2010, held in Lausanne, Switzerland in June 2010. The 34 papers presented were carefully reviewed and selected from 135 submissions. The conference has become the main forum for recent results in integer programming and combinatorial optimization in the non-symposium years.
