Download or read book Integer Programming Approaches for Semicontinuous and Stochastic Optimization written by Gustavo Angulo Olivares (I.) and published by . This book was released on 2014 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: This thesis concerns the application of mixed-integer programming techniques to solve special classes of network flow problems and stochastic integer programs. We draw tools from complexity and polyhedral theory to analyze these problems and propose improved solution methods. In the first part, we consider semi-continuous network flow problems, that is, a class of network flow problems where some of the variables are required to take values above a prespecified minimum threshold whenever they are not zero. These problems find applications in management and supply chain models where orders in small quantities are undesirable. We introduce the semi-continuous inflow set with variable upper bounds as a relaxation of general semi-continuous network flow problems. Two particular cases of this set are considered, for which we present complete descriptions of the convex hull in terms of linear inequalities and extended formulations. We also consider a class of semi-continuous transportation problems where inflow systems arise as substructures, for which we investigate complexity questions. Finally, we study the computational efficacy of the developed polyhedral results in solving randomly generated instances of semi-continuous transportation problems. In the second part, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of optimizing a linear function on the subset of vertices of P that are not contained in X. This problem is closely related to finding the k-best basic solutions to a linear problem and finds applications in stochastic integer programming. We observe that the complexity of the problem depends on how P and X are specified. For instance, P can be explicitly given by its linear description, or implicitly by an oracle. Similarly, X can be explicitly given as a list of vectors, or implicitly as a face of P. While removing vertices turns to be hard in general, it is tractable for tractable 0-1 polytopes, and compact extended formulations can be obtained. Some extensions to integral polytopes are also presented. The third part is devoted to the integer L-shaped method for two-stage stochastic integer programs. A widely used model assumes that decisions are made in a two-step fashion, where first-stage decisions are followed by second-stage recourse actions after the uncertain parameters are observed, and we seek to minimize the expected overall cost. In the case of finitely many possible outcomes or scenarios, the integer L-shaped method proposes a decomposition scheme akin to Benders' decomposition for linear problems, but where a series of mixed-integer subproblems have to be solved at each iteration. To improve the performance of the method, we devise a simple modification that alternates between linear and mixed-integer subproblems, yielding significant time savings in instances from the literature. We also present a general framework to generate optimality cuts via a cut-generating problem. Using an extended formulation of the forbidden-vertices problem, we recast our cut-generating problem as a linear problem and embed it within the integer L-shaped method. Our numerical experiments suggest that this approach can prove beneficial when the first-stage set is relatively complicated.
Download or read book Stochastic Optimization written by Kurt Marti and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 189 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume includes a selection of refereed papers presented at the GAMM/IFIP-Workshop on "Stochastic Optimization: Numerical Methods and Technical Applications", held at the Federal Armed Forces University Munich, May 29 - 31, 1990. The objective of this meeting was to bring together scientists from Stochastic Programming and from those Engineering areas, where Mathematical Programming models are common tools, as e. g. Optimal Structural Design, Power Dispatch, Acid Rain Management etc. The first, theoretical part includes the papers by S. D. Flam. H. Niederreiter, E. Poechinger and R. Schultz. The second part on methods and applications contains the articles by N. Baba, N. Grwe and W. Roemisch, J. Mayer, E. A. Mc Bean and A. Vasarhelyi.
Download or read book Stochastic Linear Programming Algorithms written by Janos Mayer and published by Taylor & Francis. This book was released on 2022-04-19 with total page 164 pages. Available in PDF, EPUB and Kindle. Book excerpt: A computationally oriented comparison of solution algorithms for two stage and jointly chance constrained stochastic linear programming problems, this is the first book to present comparative computational results with several major stochastic programming solution approaches. The following methods are considered: regularized decomposition, stochastic decomposition and successive discrete approximation methods for two stage problems; cutting plane methods, and a reduced gradient method for jointly chance constrained problems. The first part of the book introduces the algorithms, including a unified approach to decomposition methods and their regularized counterparts. The second part addresses computer implementation of the methods, describes a testing environment based on a model management system, and presents comparative computational results with the various algorithms. Emphasis is on the computational behavior of the algorithms.
Download or read book Stochastic Optimization written by Stanislav Uryasev and published by Springer Science & Business Media. This book was released on 2013-03-09 with total page 438 pages. Available in PDF, EPUB and Kindle. Book excerpt: Stochastic programming is the study of procedures for decision making under the presence of uncertainties and risks. Stochastic programming approaches have been successfully used in a number of areas such as energy and production planning, telecommunications, and transportation. Recently, the practical experience gained in stochastic programming has been expanded to a much larger spectrum of applications including financial modeling, risk management, and probabilistic risk analysis. Major topics in this volume include: (1) advances in theory and implementation of stochastic programming algorithms; (2) sensitivity analysis of stochastic systems; (3) stochastic programming applications and other related topics. Audience: Researchers and academies working in optimization, computer modeling, operations research and financial engineering. The book is appropriate as supplementary reading in courses on optimization and financial engineering.
Download or read book Lectures on Stochastic Programming Modeling and Theory Third Edition written by Alexander Shapiro and published by SIAM. This book was released on 2021-08-19 with total page 540 pages. Available in PDF, EPUB and Kindle. Book excerpt: An accessible and rigorous presentation of contemporary models and ideas of stochastic programming, this book focuses on optimization problems involving uncertain parameters for which stochastic models are available. Since these problems occur in vast, diverse areas of science and engineering, there is much interest in rigorous ways of formulating, analyzing, and solving them. This substantially revised edition presents a modern theory of stochastic programming, including expanded and detailed coverage of sample complexity, risk measures, and distributionally robust optimization. It adds two new chapters that provide readers with a solid understanding of emerging topics; updates Chapter 6 to now include a detailed discussion of the interchangeability principle for risk measures; and presents new material on formulation and numerical approaches to solving periodical multistage stochastic programs. Lectures on Stochastic Programming: Modeling and Theory, Third Edition is written for researchers and graduate students working on theory and applications of optimization, with the hope that it will encourage them to apply stochastic programming models and undertake further studies of this fascinating and rapidly developing area.
Download or read book Integer Programming Approaches for Some Non convex and Stochastic Optimization Problems written by James Luedtke and published by . This book was released on 2007 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: In this dissertation we study several non-convex and stochastic optimization problems. The common theme is the use of mixed-integer programming (MIP) techniques including valid inequalities and reformulation to solve these problems.
Download or read book Lectures on Stochastic Programming written by Alexander Shapiro and published by SIAM. This book was released on 2014-07-09 with total page 512 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Download or read book Network Interdiction and Stochastic Integer Programming written by David L. Woodruff and published by Springer Science & Business Media. This book was released on 2006-04-11 with total page 134 pages. Available in PDF, EPUB and Kindle. Book excerpt: On March 15, 2002 we held a workshop on network interdiction and the more general problem of stochastic mixed integer programming at the University of California, Davis. Jesús De Loera and I co-chaired the event, which included presentations of on-going research and discussion. At the workshop, we decided to produce a volume of timely work on the topics. This volume is the result. Each chapter represents state-of-the-art research and all of them were refereed by leading investigators in the respective fields. Problems - sociated with protecting and attacking computer, transportation, and social networks gain importance as the world becomes more dep- dent on interconnected systems. Optimization models that address the stochastic nature of these problems are an important part of the research agenda. This work relies on recent efforts to provide methods for - dressing stochastic mixed integer programs. The book is organized with interdiction papers first and the stochastic programming papers in the second part. A nice overview of the papers is provided in the Foreward written by Roger Wets.
Download or read book Numerical Techniques for Stochastic Optimization written by I︠U︡riĭ Mikhaĭlovich Ermolʹev and published by Springer. This book was released on 1988 with total page 608 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Lectures on Stochastic Programming written by Alexander Shapiro and published by SIAM. This book was released on 2009-01-01 with total page 447 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Download or read book Decision Making with Dominance Constraints in Two Stage Stochastic Integer Programming written by Uwe Gotzes and published by Springer Science & Business Media. This book was released on 2009-09-30 with total page 96 pages. Available in PDF, EPUB and Kindle. Book excerpt: Uwe Gotzes analyzes an approach to account for risk aversion in two-stage models based upon partial orders on the set of real random variables. He illustrates the superiority of the proposed decomposition method over standard solvers for example with numerical experiments with instances from energy investment.
Download or read book Approaches to Integer Programming written by M. L. Balinski and published by . This book was released on 1974 with total page 212 pages. Available in PDF, EPUB and Kindle. Book excerpt: Branch and bound experiments in 0-1 programming; A subadditive approach to the group problem of integer programming; Two computationaly difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems; Lagrangean relaxation for integer programming; A heuristic algorithm for mixed-integer programming problems; On the group problem for mixed integer programming; Experiments in the formulation of integer programming problems.
Download or read book Stochastic Programming Methods and Technical Applications written by Kurt Marti and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 448 pages. Available in PDF, EPUB and Kindle. Book excerpt: Optimization problems arising in practice usually contain several random parameters. Hence, in order to obtain optimal solutions being robust with respect to random parameter variations, the mostly available statistical information about the random parameters should be considered already at the planning phase. The original problem with random parameters must be replaced by an appropriate deterministic substitute problem, and efficient numerical solution or approximation techniques have to be developed for those problems. This proceedings volume contains a selection of papers on modelling techniques, approximation methods, numerical solution procedures for stochastic optimization problems and applications to the reliability-based optimization of concrete technical or economic systems.
Download or read book Dynamic Stochastic Optimization written by Kurt Marti and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 337 pages. Available in PDF, EPUB and Kindle. Book excerpt: Uncertainties and changes are pervasive characteristics of modern systems involving interactions between humans, economics, nature and technology. These systems are often too complex to allow for precise evaluations and, as a result, the lack of proper management (control) may create significant risks. In order to develop robust strategies we need approaches which explic itly deal with uncertainties, risks and changing conditions. One rather general approach is to characterize (explicitly or implicitly) uncertainties by objec tive or subjective probabilities (measures of confidence or belief). This leads us to stochastic optimization problems which can rarely be solved by using the standard deterministic optimization and optimal control methods. In the stochastic optimization the accent is on problems with a large number of deci sion and random variables, and consequently the focus ofattention is directed to efficient solution procedures rather than to (analytical) closed-form solu tions. Objective and constraint functions of dynamic stochastic optimization problems have the form of multidimensional integrals of rather involved in that may have a nonsmooth and even discontinuous character - the tegrands typical situation for "hit-or-miss" type of decision making problems involving irreversibility ofdecisions or/and abrupt changes ofthe system. In general, the exact evaluation of such functions (as is assumed in the standard optimization and control theory) is practically impossible. Also, the problem does not often possess the separability properties that allow to derive the standard in control theory recursive (Bellman) equations.
Download or read book Integer Programming Approaches to Risk averse Optimization written by Xiao Liu and published by . This book was released on 2016 with total page 182 pages. Available in PDF, EPUB and Kindle. Book excerpt: Risk-averse stochastic optimization problems widely exist in practice, but are generally challenging computationally. In this dissertation, we conduct both theoretical and computational research on these problems. First, we study chance-constrained two-stage stochastic optimization problems where second-stage feasible recourse decisions incur additional cost. We also propose a new model, where recovery decisions are made for the infeasible scenarios, and develop strong decomposition algorithms. Our computational results show the effectiveness of the proposed method. Second, we study the static probabilistic lot-sizing problem (SPLS), as an application of a two-stage chance-constrained problem in supply chains. We propose a new formulation that exploits the simple recourse structure, and give two classes of strong valid inequalities, which are shown to be computationally effective. Third, we study two-sided chance-constrained programs with a finite probability space. We reformulate this class of problems as a mixed-integer program. We study the polyhedral structure of the reformulation and propose a class of facet-defining inequalities. We propose a polynomial dynamic programming algorithm for the separation problem. Preliminary computational results are encouraging. Finally, we study risk-averse models for multicriteria stochastic optimization problems. We propose a new model that optimizes the worst-case multivariate conditional value-at-risk (CVaR), and develop a finitely convergent delayed cut generation algorithm.
Download or read book Stochastic Programming written by Gerd Infanger and published by Springer Science & Business Media. This book was released on 2010-11-10 with total page 373 pages. Available in PDF, EPUB and Kindle. Book excerpt: From the Preface... The preparation of this book started in 2004, when George B. Dantzig and I, following a long-standing invitation by Fred Hillier to contribute a volume to his International Series in Operations Research and Management Science, decided finally to go ahead with editing a volume on stochastic programming. The field of stochastic programming (also referred to as optimization under uncertainty or planning under uncertainty) had advanced significantly in the last two decades, both theoretically and in practice. George Dantzig and I felt that it would be valuable to showcase some of these advances and to present what one might call the state-of- the-art of the field to a broader audience. We invited researchers whom we considered to be leading experts in various specialties of the field, including a few representatives of promising developments in the making, to write a chapter for the volume. Unfortunately, to the great loss of all of us, George Dantzig passed away on May 13, 2005. Encouraged by many colleagues, I decided to continue with the book and edit it as a volume dedicated to George Dantzig. Management Science published in 2005 a special volume featuring the “Ten most Influential Papers of the first 50 Years of Management Science.” George Dantzig’s original 1955 stochastic programming paper, “Linear Programming under Uncertainty,” was featured among these ten. Hearing about this, George Dantzig suggested that his 1955 paper be the first chapter of this book. The vision expressed in that paper gives an important scientific and historical perspective to the book. Gerd Infanger
Download or read book Separable Programming written by S.M. Stefanov and published by Springer Science & Business Media. This book was released on 2001-05-31 with total page 340 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this book, the author considers separable programming and, in particular, one of its important cases - convex separable programming. Some general results are presented, techniques of approximating the separable problem by linear programming and dynamic programming are considered. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. Numerical approximation with respect to I1 and I4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well. Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists.
