Technical Note—Column Dropping in the Dantzig-Wolfe Convex Programming Algorithm: Computational Experience

Richard P. O'Neill
Additional contact information
Richard P. O'Neill: Louisiana Stale University, Baton Rouge, Louisiana

Operations Research, 1977, vol. 25, issue 1, 148-155

Abstract: This paper presents some computational experience on column dropping using the Dantzig-Wolfe convex programming algorithm. Computational results show virtually no difference in the measures of computational efficiency when all columns are retained and when only basic columns are retained.

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.1.148 (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:oropre:v:25:y:1977:i:1:p:148-155

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().