Pages that link to "Item:Q1289294"
From MaRDI portal
The following pages link to The use of discrete moment bounds in probabilistic constrained stochastic programming models (Q1289294):
Displaying 12 items.
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions (Q271981) (← links)
- An arc-exchange decomposition method for multistage dynamic networks with random arc capacities (Q296965) (← links)
- A preliminary set of applications leading to stochastic semidefinite programs and chance-constrained semidefinite programs (Q554728) (← links)
- Three-dimensional geometric moment bounding techniques (Q1148853) (← links)
- A numerical method for solving stochastic programming problems with moment constraints on a distribution function (Q1176853) (← links)
- Bounds for probabilistic programming with application to a blend planning problem (Q2060407) (← links)
- Higher-moment buffered probability (Q2329645) (← links)
- Approximating two-stage chance-constrained programs with classical probability bounds (Q2329660) (← links)
- Monge properties, discrete convexity and applications (Q2432877) (← links)
- Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints (Q2806828) (← links)
- Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622) (← links)
- Multilinear approximation on rectangles and the related moment problem (Q5313464) (← links)
