CUTTING PLANES AND COLUMN GENERATION TECHNIQUES WITH THE PROJECTIVE ALGORITHM

被引:27
作者
GOFFIN, JL [1 ]
VIAL, JP [1 ]
机构
[1] UNIV GENEVA, CH-1211 GENEVA 4, SWITZERLAND
关键词
column generation techniques; cutting planes; Karmarkar's algorithm; nondifferentiable optimization;
D O I
10.1007/BF00939559
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The problem studied is that of solving linear programs defined recursively by column generation techniques or cutting plane techniques using, respectively, the primal projective method or the dual projective method. © 1990 Plenum Publishing Corporation.
引用
收藏
页码:409 / 429
页数:21
相关论文
共 22 条
[1]   AN IMPLEMENTATION OF KARMARKAR ALGORITHM FOR LINEAR-PROGRAMMING [J].
ADLER, I ;
RESENDE, MGC ;
VEIGA, G ;
KARMARKAR, N .
MATHEMATICAL PROGRAMMING, 1989, 44 (03) :297-335
[2]   A Monotonic Projective Algorithm for Fractional Linear Programming [J].
Anstreicher, Kurt M. .
ALGORITHMICA, 1986, 1 (1-4) :483-498
[3]  
Benders J.F., 1962, NUMER MATH, V4, P252, DOI DOI 10.1007/BF01386316
[4]   THE DECOMPOSITION ALGORITHM FOR LINEAR-PROGRAMS [J].
DANTZIG, GB ;
WOLFE, P .
ECONOMETRICA, 1961, 29 (04) :767-778
[5]   A Polynomial Newton Method for Linear Programming [J].
de Ghellinck, Guy ;
Vial, Jean-Philippe .
ALGORITHMICA, 1986, 1 (1-4) :425-453
[6]   AN EXTENSION OF KARMARKAR ALGORITHM FOR SOLVING A SYSTEM OF LINEAR HOMOGENEOUS EQUATIONS ON THE SIMPLEX [J].
DEGHELLINCK, G ;
VIAL, JP .
MATHEMATICAL PROGRAMMING, 1987, 39 (01) :79-92
[7]  
DIKIN II, 1967, DOKL AKAD NAUK SSSR+, V174, P747
[8]   AN ANALOG OF KARMARKAR ALGORITHM FOR INEQUALITY CONSTRAINED LINEAR-PROGRAMS, WITH A NEW CLASS OF PROJECTIVE TRANSFORMATIONS FOR CENTERING A POLYTOPE [J].
FREUND, RM .
OPERATIONS RESEARCH LETTERS, 1988, 7 (01) :9-13
[9]  
GAY DA, 1987, 136 AT T BELL LAB CO