About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Mathematical Programming Study
Paper
DUAL NESTED DECOMPOSITION OF STAIRCASE LINEAR PROGRAMS.
Abstract
A staircase linear program is a linear program in which the variables can be partitioned into a set of time periods, with constraints relating only variables in adjacent periods. This paper describes a specialized technique for solving staircase LP's, called a 'nested decomposition' algorithm. This technique applies the Dantzig-Wolfe decomposition principle to the dual of the LP in a recursive manner. The resulting algorithm solves a sequence of small LP's, one corresponding to each period. Each period communicates with the period that follows it by determining its right-hand side and with the period that precedes it by adding constraints. Some computational experience is presented.