Abstract
For stochastic programs with complete (linear) recourse we present easily verifiable sufficient conditions for the strong convexity of the expected-recourse function. Both, programs with random right-hand side and with random technology matrix are considered. Among the implications of strong convexity those with respect to the stability of stochastic programs are worked out in detail. In this way, former results on the quantitative stability of optimal solutions are extended.
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.
