A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem
John W. Mamer () and
Richard D. McBride ()
Additional contact information
John W. Mamer: Anderson Graduate School of Management, University of California, Los Angeles, Box 951481, 110 Westwood Plaza, Los Angeles, California 90095-1481
Richard D. McBride: Marshall School of Business, University of Southern California, Los Angeles, California 90089-0809
Management Science, 2000, vol. 46, issue 5, 693-709
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.
Keywords: linear programming; multicommodity flows; optimization (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)
Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.46.5.693.12042 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:46:y:2000:i:5:p:693-709
Access Statistics for this article
More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().