| Article ID: | iaor19981467 |
| Country: | Netherlands |
| Volume: | 7 |
| Issue: | 1 |
| Start Page Number: | 143 |
| End Page Number: | 158 |
| Publication Date: | Jan 1997 |
| Journal: | Computational Optimization and Applications |
| Authors: | Zenios Stavros A., Yang Dafeng |
| Keywords: | interior point methods, robust optimization |
We present a computationally efficient implementation of an interior point algorithm for solving large-scale problems arising in stochastic linear programming and robust optimization. A matrix factorization procedure is employed that exploits the structure of the constraint matrix, and it is implemented on parallel computers. The implementation is perfectly scalable. Extensive computational results are reported for a library of standard test problems from stochastic linear programming, and also for robust optimization formulations. The results show that the codes are efficient and stable for problems with thousands of scenarios. Test problems with 130 thousand scenarios, and a deterministic equivalent linear programming formulation with 2.6 million constraints and 18.2 million variables, are solved successfully.