Abstract
A two-stage stochastic convex program with relatively complete recourse in $L^\infty $-space is replaced by a mathematical programming problem in a finite-dimensional space. Using discrete convergence of mappings, conditions are presented that guarantee the convergence of the sequence of solutions of approximate problems to the solution of the initial problem.
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.
