Confidence-based reasoning in stochastic constraint programming
From MaRDI portal
Publication:896433
Abstract: In this work we introduce a novel approach, based on sampling, for finding assignments that are likely to be solutions to stochastic constraint satisfaction problems and constraint optimisation problems. Our approach reduces the size of the original problem being analysed; by solving this reduced problem, with a given confidence probability, we obtain assignments that satisfy the chance constraints in the original model within prescribed error tolerance thresholds. To achieve this, we blend concepts from stochastic constraint programming and statistics. We discuss both exact and approximate variants of our method. The framework we introduce can be immediately employed in concert with existing approaches for solving stochastic constraint programs. A thorough computational study on a number of stochastic combinatorial optimisation problems demonstrates the effectiveness of our approach.
Recommendations
- Stochastic constraint programming: A scenario-based approach
- scientific article; zbMATH DE number 1332640
- Probabilistic concurrent constraint programming
- Confidence level solutions for stochastic programming
- Solutions for hard and soft constraints using optimized probabilistic satisfiability
- Robustness and stability in constraint programming under dynamism and uncertainty
- Constraint-based inference in probabilistic logic programs
- A generic approach to combining stochastic algorithms with systematic constraint solvers
- Probabilistic Reasoning with Continuous Constraints
Cites work
- scientific article; zbMATH DE number 5547872 (Why is no real title available?)
- scientific article; zbMATH DE number 1194779 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2084697 (Why is no real title available?)
- scientific article; zbMATH DE number 1495246 (Why is no real title available?)
- scientific article; zbMATH DE number 1865863 (Why is no real title available?)
- scientific article; zbMATH DE number 3189754 (Why is no real title available?)
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A Note on the Convolution of the Uniform and Related Distributions and Their Use in Quality Control
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A global chance-constraint for stochastic inventory systems under service level constraints
- A single-resource allocation problem with Poisson resource requirements
- A survey on CP-AI-OR hybrids for decision making under uncertainty
- A theory of rolling horizon decision making
- An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model
- Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
- Complexity and approximability of quantified and stochastic constraint satisfaction problems
- Computational complexity of stochastic programming problems
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
- Filtering algorithms for global chance constraints
- Games against nature
- Generalizations of the familywise error rate
- Handbook of constraint programming.
- Hybrid metaheuristics for stochastic constraint programming
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Introduction to Stochastic Programming
- On relations between chance constrained and penalty function problems under discrete distributions
- On the distribution of the sum of independent uniform random variables
- Probability Inequalities for Sums of Bounded Random Variables
- Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints
- Sample average approximation method for chance constrained programming: Theory and applications
- Sample average approximation of expected value constrained stochastic programs
- Simultaneous statistical inference. 2nd ed
- Statistical constraints
- Stochastic Boolean satisfiability
- Stochastic constraint programming: A scenario-based approach
- Stochastic linear programming. Models, theory, and computation.
- Stochastic programming problems with generalized integrated chance constraints
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- Sub-optimality Approximations
- The dynamic and stochastic knapsack problem
- The empirical behavior of sampling methods for stochastic programming
- The sample average approximation method for stochastic discrete optimization
Cited in
(9)- Confidence level solutions for stochastic programming
- Stochastic constraint programming: A scenario-based approach
- Stochastic constraint programming by neuroevolution with filtering
- Robustness and stability in constraint programming under dynamism and uncertainty
- A model‐and data‐driven predictive control approach for tracking of stochastic nonlinear systems using Gaussian processes
- Introducing statistical consistency for infinite chance constraints
- Exploring stochasticity and imprecise knowledge based on linear inequality constraints
- Filtering algorithms for global chance constraints
- Modeling uncertainties with chance constraints
This page was built for publication: Confidence-based reasoning in stochastic constraint programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896433)
