A parallel decomposition algorithm for staircase linear programs
Stanford University, Dept. of Operations Research, Systems Optimization Laboratory, 1988 - Mathematics - 20 pages
A simple diet planning problem is used to demonstrate the principles of the algorithm's development and performance. When applied to this problem, the parallel decomposition algorithm shows promise relative to present serial optimization codes. The nonlinear optimization code MINOS 5.1 is used both as a basis for comparison and as a generic subproblem solver. The greatest room for speedup is in exploiting problem structures. The results show that decomposition can improve efficiency even with a single processor. Examples are given where multiple processors lead to still greater efficiency."
4 pages matching optimal selection in this book
Results 1-3 of 4
What people are saying - Write a review
A Parallel Decomposition Algorithm for Staircase Linear Programs.
As part of an extended research project on the parallel decomposition of linear programs, a parallel algorithm for Staircase Linear Programs was designed ...
stinet.dtic.mil/ oai/ oai?verb=getRecord&