Sharp Bounds on the Value of Perfect Information
From MaRDI portal
Recommendations
- The Value of Information and Stochastic Programming
- Bounds for Two-Stage Stochastic Programs with Fixed Recourse
- Restricted-recourse bounds for stochastic linear programming
- Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
- scientific article; zbMATH DE number 433031
Cited in
(18)- A hierarchy of bounds for stochastic mixed-integer programs
- Two-stage stochastic standard quadratic optimization
- The value of the stochastic solution in stochastic linear programs with fixed recourse
- A perfect information lower bound for robust lot-sizing problems
- Bounds on the value of information in uncertain decision problems II
- Maximizing the net present value of a project under uncertainty: activity delays and dynamic policies
- The interface between OR/MS and decision theory
- Effects of risk aversion on the value of information in two-action decision problems
- The value of side information in network flow optimization
- Inequalities in completely convex stochastic programming
- Sensitivity analysis: a review of recent advances
- Stochastic programming
- Bounds in multi-horizon stochastic programs
- The Value of Information and Stochastic Programming
- Monotonic bounds in multistage mixed-integer stochastic programming
- scientific article; zbMATH DE number 433031 (Why is no real title available?)
- Reduced cost-based variable fixing in two-stage stochastic programming
- On information-augmented chance-constrained programs
This page was built for publication: Sharp Bounds on the Value of Perfect Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4161091)
