Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema

References

• Adler , I. , Karmarkar , N. , Resende , M.G.C. and Vciga , G. 1989 . Data structures and programming techniques for the implementation of Karmarkar’s algorithm . ORSA Journal on Computing , 1 : 84 – 106 .
   Google Scholar
• Amaya , J. 1992 . Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problems , Université Catholique de Louvain . CORE Discussion Paper 9241
   Google Scholar
• Adler , I. , Resende , M.G.C. , Veiga , G. and Karmarkar , N. 1989 . An implementation of Karmarkar’s algorithm for linear programming . Mathematical Programming , 44 : 297 – 335 .
   Web of Science ®Google Scholar
• Barnes , E. 1986 . A variation on Karmarkar’s algorithm for solving linear programming problems . Mathematical Programming , 36 : 174 – 182 .
   Web of Science ®Google Scholar
• Dikin , I. 1967 . Iterative solution of problems of linear and quadratic programming . Soviet Mathematics Doklady , 8 : 674 – 675 .
   Google Scholar
• Dikin , I. 1974 . On the speed of an iterative process . Upravlyaemye Sistemi , 12 : 54 – 60 .
   Google Scholar
• El-Bakry , A.S. , Tapia , R.A. and Zhang , Y. 1991 . A study of indicators for identifying zero variables in interior-point methods , Rice University . Technical Report TR91-15, Department of Mathematical Sciences
   Google Scholar
• Golub , G.H. and Van Loan , Ch.F. 1983 . Matrix Computations , North Oxford Academic Pub. Co. Ltd . 1983
   Google Scholar
• Jackson , R.H.F. , Boggs , P.T. , Nash , S.G. and Powell , S. 1991 . Guidelines for reporting results of computational experiments . Mathematical Programming , 49 : 413 – 425 . Report of the ad hoc committee
   Web of Science ®Google Scholar
• Kojima , M. , Mizuno , S. and Yoshise , A. 1989 . “ A primal-dual interior point algorithm for linear programming,In ” . In Progress in Mathematical Programming Interior Point and Related Methods , Edited by: Megiddo , N. Springer Verlag .
   Google Scholar
• Marsten , R.E. , Saltzman , M.J. , Shanno , D. , Pierce , G.S. and Ballintijn , J.F. 1989 . Implementation of a dual affine interior point algorithm for linear programming . ORSA Journal on Computing , 1 : 287 – 297 .
   Google Scholar
• McShane , K.A. , Monma , C.L. and Shanno , D. 1989 . An implementation of a primal-dual interior method for linear programming . ORSA Journal on Computing , 1 : 70 – 83 .
   Google Scholar
• Monma , C.L. and Morton , A.J. 1987 . Computational experience with a dual afine variant of Karmarkar’s method for linear programming . Operations Research Letters , 6 : 261 – 267 .
   Web of Science ®Google Scholar
• Monteiro , R.C. , Adler , I. and Resende , M.G.C. 1990 . A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension . Mathematics of Operations Research , 15 : 191 – 214 .
   Web of Science ®Google Scholar
• Tapia , R.A. and Zhang , Y. 1991 . An optimal basis identification tcchnique for interior-point linear programming algorithms . Linear Algebra and its Applications , 152 : 343 – 363 .
   Web of Science ®Google Scholar
• Todd , M.J. 1989 . Probalistic models for linear programming , Cornell University . Technical Report 836, School of Op. Res. and Ind. Eng
   Google Scholar
• Todd M. J. The effects of sparsity, degencracy and null and unbounded variables on variants of Karmarkar’s linear programming algorithm Large Scale Numerical Optimization Coleman T.F. Li Y. SIAM 1990
   Google Scholar
• Vanderbei , R.J. and Lagarias , J.C. 1990 . I. I. Dikin’s convergence results for the affine scaling algorithm . Contemporary Mathematics , 114 : 109 – 119 .
   Google Scholar
• Vanderbei , R.J. , Meketon , S. and Freedman , B.A. 1986 . A modification of Karmarkar’s linear programming algorithm . Algorithmica , 1 : 395 – 407 .
   Web of Science ®Google Scholar