Computational results with a primal-dual subproblem simplex method

Authors:
Jing Hu;Ellis L. Johnson
Affiliations:
School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA 30332-0205, USA;School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA 30332-0205, USA
Venue:
Operations Research Letters
Year:
1999

Citing 4
Cited 7

A global approach to crew-pairing optimization

IBM Systems Journal
Very large-scale linear programming: a case study in combining interior point and simplex methods

Operations Research
Solving binary cutting stock problems by column generation and branch-and-bound

Computational Optimization and Applications
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research

Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition

Transportation Science
Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition

Transportation Science
Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design

Computers and Operations Research
Multiobjective genetic algorithm to solve the train crew scheduling problem

ISTASC'10 Proceedings of the 10th WSEAS international conference on Systems theory and scientific computation
A new efficient parallel revised relaxation algorithm

ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
A dual ascent procedure for the set partitioning problem

Discrete Optimization
A parallel primal-dual simplex algorithm

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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 cutting stock. The matrix storage schemes are different for these two problem classes, and the one for cutting stock is a hybrid using dynamic programming ideas.