References
- Afriat , S.N. 1970 . The progressive support method for convex programming . SIAM J. Numer. Anal , 7 ( 3 ) : 447 – 457 .
- Broise , P. , Huard , P. and Sentenac , J. 1968 . Décomposition des programmes mathématiques , Paris : Dunod .
- Dantzig , G.B. 1963 . Linear programming and extensions , Princeton , N.J : Princeton University Press .
- Golstein , E.G. 1976 . Dualitätsthe one in cier nicnuxinearen Optimierung und ihre An- wendung , Berlin : Akademie-Verlag . translation from the rassian
- Cheney , E.W. and Goldstein , A.A. 1959 . Newton's method of convex programming and Tchebycheff approximation . Numer. Math , 1 : 253 – 268 .
- Holloway , C.A. 1973 . A generalized approach to Dahtzig-Wolfe decomposition for convave programs . Opns. Res , 21 ( 1 ) : 210 – 220 .
- Kelley , J.E. 1960 . The cutting-plane method for solving convex programs . J. Soc. Ind. Appl. Math , 8 ( 4 ) : 704 – 712 .
- Murphy , F.K. 1973 . A column generation algorithm for nonlinear programming . Math. Programming , 5 ( 3 ) : 286 – 298 .
- Murphy , F. 1973 . Column dropping procedures for the generalized programming algorithm . Management Soi , 19 ( 11 ) : 1310 – 1321 .
- Nemhauser , G.L. and Widhelm , W.B. 1971 . A modified linear program for columnar methods m mathematical programming . Opns. Res , 19 ( 4 ) : 1051 – 1060 .
- Rockafellar , R.T. 1970 . Convex Analysis , Princeton , N.J : Princeton University press .
- Topkis , D.M. 1970 . Cutting plane methods without nested constraint sets . Opns. Res , 18 ( 3 ) : 404 – 413 .
- Topkis , D.M. 1970 . A note on cutting plane methods without nested constraint sets . Opns. Res , 18 ( 6 ) : 1216 – 1224 .
- Veinott , A.F. Jr . 1967 . The supporting hyperplane method for unimodal programming . Opns. Res , 15 ( 1 ) : 147 – 152 .
- Zangwill , W. 1969 . Nonlinear programming: a unified approach , Englewood Cliffs , N. J : Prentice-Hall .
- Zangwill , W.I. and Cubtis Eaves , B. 1971 . Generalized cutting plane algorithms . SIAM J. Control , 9 ( 4 ) : 529 – 542 .