Note—Nested Decomposition of a Dynamic Energy Model

Published Online:https://doi.org/10.1287/mnsc.23.9.1022

This paper reports computational experience in using a nested decomposition (staircase) algorithm to solve a version of Manne's linear programming model of U. S. energy options. Nested decomposition is found to be 28% to 52% faster than a direct simplex approach for our test problems. Effects of various computational strategies are also investigated. Our results indicate the applicability of nested decomposition to the important class of staircase linear programs arising from dynamic energy models.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.