A decomposition algorithm for two-stage stochastic programs with approximate rotational invariance
Abstract
We propose an algorithm of approximating the optimal objective value of a two-stage stochastic program under an assumption of approximate rotational invariance of the technology matrix, and compare the method with the L-shaped decomposition.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.