Abstract
Bounds on the expected value of a convex function are obtained by means of an approximating generalized moment problem. Numerical implementation is discussed in the context of stochastic programming problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
