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

Simple item page
dc.contributor.authorBixby, Robert E.en_US
dc.contributor.authorGregory, John W.en_US
dc.contributor.authorLustig, Irvin J.en_US
dc.contributor.authorMarsten, Roy E.en_US
dc.contributor.authorShanno, David F.en_US
dc.date.accessioned2018-06-18T17:30:45Zen_US
dc.date.available2018-06-18T17:30:45Zen_US
dc.date.issued1991-05en_US
dc.date.noteMay 1991en_US
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.en_US
dc.format.extent24 ppen_US
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>.en_US
dc.identifier.digitalTR91-11en_US
dc.identifier.urihttps://hdl.handle.net/1911/101715en_US
dc.language.isoengen_US
dc.titleVery Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methodsen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
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
CMOR Technical Reports