Abstract
In usual stochastic programming problems involving randomly distributed resources and chance constraints, decision variables are taken as deterministic. With the help of simple illustrations involving a single decision variable, Vajda and Greenberg showed that minimum expected values could be made smaller by treating the decision variable as random. This idea has been extended here to the case of two decision variables. The difficulty of finding an optimal mixed strategy in the case of an infinite-range distribution of the decision variable(s) has also been shown.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
