Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods

Simple item page
dc.contributor.authorBixby, Robert E.
dc.contributor.authorGregory, John W.
dc.contributor.authorLustig, Irvin J.
dc.contributor.authorMarsten, Roy E.
dc.contributor.authorShanno, David F.
dc.date.accessioned2018-06-18T17:30:45Z
dc.date.available2018-06-18T17:30:45Z
dc.date.issued1991-05
dc.date.noteMay 1991
dc.description.abstractExperience with solving a 12,753,313 variable linear program is described. This problem is the linear programming relaxation of a set partitioning problem arising from an airline crew scheduling application. A scheme is described that requires successive solutions of small subproblems, yielding a procedure that has little growth in solution time in terms of the number of variables. Experience using the simplex method as implemented in CPLEX, an interior point method as implemented in OB1, and hybrid interior point/simplex approach is reported. The resulting procedure illustrates the power of an interior point/simplex combination for solving very large-scale linear programs.
dc.format.extent24 pp
dc.identifier.citationBixby, Robert E., Gregory, John W., Lustig, Irvin J., et al.. "Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods." (1991) <a href="https://hdl.handle.net/1911/101715">https://hdl.handle.net/1911/101715</a>.
dc.identifier.digitalTR91-11
dc.identifier.urihttps://hdl.handle.net/1911/101715
dc.language.isoeng
dc.titleVery Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR91-11.pdf
Size:
352.29 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports