Computational results with a primal-dual subproblem simplex method

Authors
Hu, J Johnson, EL
Citation
J. Hu et El. Johnson, Computational results with a primal-dual subproblem simplex method, OPER RES L, 25(4), 1999, pp. 149-157
Citations number
11
Categorie Soggetti
Engineering Mathematics
Journal title
OPERATIONS RESEARCH LETTERS
ISSN journal
01676377 → ACNP
Volume
25
Issue
4
Year of publication
1999
Pages
149 - 157
Database
ISI
SICI code
0167-6377(199911)25:4<149:CRWAPS>2.0.ZU;2-O
Abstract
The two main ideas implemented are a primal-dual subproblem simplex method and a compact matrix storage scheme to speed up linear programming solution times. Two classes of problems are solved: crew-pairing optimization and c utting stock. The matrix storage schemes are different for these two proble m classes, and the one for cutting stock is a hybrid using dynamic programm ing ideas. (C) 1999 Elsevier Science B.V. All rights reserved.