| Reference: | Arbel, A., Exploring Interior-Point Linear Programming. The MIT Press, (1993)
Barnes, E. R., A Variation on Algorithm for Sloving Linear Programming Problems. Mathematical Programming 36, 174-182, (1986).
Bazaraa, M. S. and C. M. Shetty, Nonlinear Programming Theory and Algorithms. John Wiley and Sons publishers(1979)
Bixby, R. E. and J. W. Gregory, I. J. Lustig, R. E. Marsten and D. F. Shanno, Very large-scale linear programming: A case study in combining interior point and simplex methods. Operations Research 40, 885-897, (1992).
Dantzig, G. B., Linear Programming and Extensions. Princeton University Press, Princeton N.J., (1963).
Dikin, I. I., Iterative Solution of Problems of Linear and Quadratic Programming. Soviet Mathematics Doklady, 8, 674-675, (1967)
Dikin, I. I., O Skhodimosti Odnogo Iteratsionnogo Protsessa.(in Russian), Upravlyaemye Sistemy, 12, 54-60, (1794)
Fang , S. C. and S. Puthenpura., Linear Optimization and Extensions. Prentice-Hall, Englewood Cliffs New Jersey, USA,(1993).
Forrest, J. J. and Donald Goldfarb, Steepest-Edge Simplex Algorithms for Linear Programming. Mathematical Programming 57, 341-374(1992).
Goldfarb, D. and J. K. Reid, A Practicable Steepest-Edge Simplex Algorithm. Mathematical Programming 12, 361-371(1977).
Huard, P. and A. Auslender, Point-to-set maps and mathematical programming. Amsterdam ; New York : North-Holland Pub. Co. (1979)
Hurley, W., Adjacent Vertex Algorithms: More Experimental Results on Random Problems. Computers and Operations Research 21, 535-541, (1994).
Karmarkar, N. K., A new polynomial time algorithm for linear programming. Combinatorica 4, 373-395, (1984).
Khachiyan, L. G., A Polynomial Algorithm in Linear Programming., Doklady Akademiia Nauk SSSR 244:s, 1093-1096, (1979), translated in Soviet Mathematics Doklady 20:1, 191-194,(1979)
Klee, V. and G. J. Minty, How Good is the Simplex Algorithm? In O. Shisha(Ed.) Inequalities 3. Academic Press, New York,(1972).
Kuhn, H. W. and R. E. Quandt, An Experimentical Study of Simplex Method. In Proceedings of the Symposia in Applied Mathematics(Edited by Metropolis et al.) XV. Providence, R.I.(1963).
Luh, H. and Ray Tsaih, An Efficient Search Direction for Linear Programming Problems. Computers and Operations Research forthcoming. Terlaky, T., Interior Point Methods of Mathematical Programming. Kluwer Academic publishers, (1996)
Trefethen, L. N. and David Bau, Numerical Linear Algebra., The Society for Industrial and Applied Mathematics, (1997)
Vanderbei, R. J., Affine-Scaling for Linear Programs with Free Variables, Mathematical Programming 43, 31-44, (1989).
Vanderbei, R. J., M. S. Meketon and B. A. Freedman., A Modiffication of Karmarkar`s Linear Programming Algorithm. Algorithmica 1, 395-407, (1986).
Ye, Y., Interior Point Algorithms Theory and Analysis., John Wiley and sons, (1997)
Winston, W. L., Operations Research Applitions and Algorithms., Duxbury Press(1994)
Wolfe, P. and L. Culter, Experiments in linear programming. In Recent Advances in Mathematical Programming(Edited by Graves and Wolfe P.). Mcgraw-Hill, New York(1963). |
