caa a22 4500 475769287 CHVBK 20180406123615.0 cr unu---uuuuu 170329e20000501xx s 000 0 eng 10.1007/s101070050002 doi (NATIONALLICENCE)springer-10.1007/s101070050002 The volume algorithm: producing primal solutions with a subgradient method [Elektronische Daten] [Francisco Barahona, Ranga Anbil] Abstract. : We present an extension to the subgradient algorithm to produce primal as well as dual solutions. It can be seen as a fast way to carry out an approximation of Dantzig-Wolfe decomposition. This gives a fast method for producing approximations for large scale linear programs. It is based on a new theorem in linear programming duality. We present successful experience with linear programs coming from set partitioning, set covering, max-cut and plant location. Springer-Verlag Berlin Heidelberg, 2000 Key words: subgradient algorithm - Dantzig-Wolfe decomposition - large scale linear programming nationallicence Mathematics Subject Classification (1991): 90C05, 90C06 nationallicence Barahona Francisco IBM T.J. Watson Research Center, Yorktown Heights, NY 10598, US aut Anbil Ranga IBM T.J. Watson Research Center, Yorktown Heights, NY 10598, US aut https://doi.org/10.1007/s101070050002 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s101070050002 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Barahona Francisco IBM T.J. Watson Research Center, Yorktown Heights, NY 10598, US aut NATIONALLICENCE 700 1- Anbil Ranga IBM T.J. Watson Research Center, Yorktown Heights, NY 10598, US aut Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer