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.
Richard P. O'Neill, (1977) Technical Note—Column Dropping in the Dantzig-Wolfe Convex Programming Algorithm: Computational Experience. Operations Research 25(1):148-155.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.