Computing Block-Angular Karmarker Projections with Applications to Stochastic Programming. Revision.
Abstract
This document presents a variant of Karmarkar's projective algorithm for block angular structured linear programs, such as stochastic linear programs. By computing the projection efficiently, the authors 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 standard algorithm. A related variant is applied to the dual program, and its implications for very large-scale problems are given. Keywords: Iterations; Points (Mathematics). (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1986
- Accession Number
- ADA185647
Entities
People
- John R. Birge
- Liqun Qi
Organizations
- University of Michigan