
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
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.
This book explores the principles and applications of probabilistic programming, a high-level language designed for defining and solving probability models. The text is structured into three chapters, beginning with an examination of "wait-and-see" problems that involve observations of random elements. Subsequent chapters delve into the analysis of decision problems, specifically two-stage problems, and the concept of "chance constraints," where satisfaction is probabilistic rather than absolute. The author, S. Vajda, presents a rigorous treatment of decision regions, probability distributions, and optimization under uncertainty, making it suitable for developers seeking to automate probabilistic model solutions.
This publication is specifically tailored for developers aiming to define and automatically solve probability models. It covers advanced topics such as decision regions for optimality, probability distributions, Kall's Theorem, and two-stage programming under uncertainty. The text also delves into concepts like the complete problem, active approach, quantile rules, randomized decisions, and nonzero order rules, indicating a comprehensive and technical treatment of probabilistic programming.
Page Count:
140
Publication Date:
2014-07-03
Publisher:
Elsevier S & T
ISBN-10:
1483268373
ISBN-13:
9781483268378
No comments yet. Be the first to share your thoughts!