A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem

Authors:
John W. Mamer;Richard D. McBride
Affiliations:
-;-
Venue:
Management Science
Year:
2000

Citing 0
Cited 12

Creating Advanced Bases For Large Scale Linear Programs Exploiting Embedded Network Structure

Computational Optimization and Applications
Exploring the influence of rewards on attitudes towards knowledge sharing

Advanced topics in information resources management
An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing

Computational Optimization and Applications
Managing Knowledge in Organizations: An Integrative Framework and Review of Emerging Themes

Management Science
A Relational View of Information Seeking and Learning in Social Networks

Management Science
Hyper-Sparsity in the Revised Simplex Method and How to Exploit it

Computational Optimization and Applications
An interior-point approach for primal block-angular problems

Computational Optimization and Applications
Selected Topics in Column Generation

Operations Research
Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM

Operations Research
Dual-Optimal Inequalities for Stabilized Column Generation

Operations Research
Scheduling training for a tank battalion: How to measure readiness

Computers and Operations Research
A linear model for compound multicommodity network flow problems

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose and test a new pricing procedure for solving large-scale structured linear programs. The procedure interactively solves a relaxed subproblem to identify potential entering basic columns. The subproblem is chosen to exploit special structure, rendering it easy to solve. The effect of the procedure is the reduction of the number of pivots needed to solve the problem. Our approach is motivated by the column-generation approach of Dantzig-Wolfe decomposition. We test our procedure on two sets of multicommodity flow problems. One group of test problems arises in routing telecommunications traffic and the second group is a set of logistics problem which have been widely used to test multicommodity flow algorithms.