We present a variant of Karmarkar's algorithm for block-angular structured linear programs, such as stochastic linear programs. By computing the projection efficiently, we give a worst-case bound on the order of the running time that can be an order of magnitude better than that of Karmarkar's...

This paper discusses the selection and design of heuristic procedures for solving one-dimensional roll trim problems. These are well-defined combinatorial problems which are too large to optimize. Five different roll trim problems from the paper and film industries are described along with the...