Abstract
Certain measure-theoretic issues raise the possibility that (a) the optimal value of a multistage stochastic programming problem may be ill-defined and (b) the recursion defining the problem may fail, so the problem itself is not even defined. The first difficulty is illustrated by example. A rigorous definition of multistage stochastic programming with fixed linear recourse is shown to avoid this difficulty. In the context of the new definition, certain measurability, convexity, and lower-semicontinuity assumptions on the objective function preclude the second possibility.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.