Show simple item record

dc.contributor.authorBixby, Robert E.
Gregory, John W.
Lustig, Irvin J.
Marsten, Roy E.
Shanno, David F.
dc.date.accessioned 2018-06-18T17:30:45Z
dc.date.available 2018-06-18T17:30:45Z
dc.date.issued 1991-05
dc.identifier.citation Bixby, 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) https://hdl.handle.net/1911/101715.
dc.identifier.urihttps://hdl.handle.net/1911/101715
dc.description.abstract Experience 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.extent 24 pp
dc.title Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
dc.type Technical report
dc.date.note May 1991
dc.identifier.digital TR91-11
dc.type.dcmi Text


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record