Revista de Matemática: Teoría y Aplicaciones ISSN Impreso: 1409-2433 ISSN electrónico: 2215-3373

OAI: https://revistas.ucr.ac.cr/index.php/matematica/oai
Método de Karmarkar
PDF (Español (España))

How to Cite

Avila Herrera, J. F. (1995). Método de Karmarkar. Revista De Matemática: Teoría Y Aplicaciones, 2(1), 45–55. https://doi.org/10.15517/rmta.v2i1.111

Abstract

This is the first of a series of two articles in wich we study the Karmarkar’sAlgorithm.In this article we present a new approach that will be called the Karmarkar’s method. We intent to present a version of this algorithm that could be implemented easily.

https://doi.org/10.15517/rmta.v2i1.111
PDF (Español (España))

References

Anstreicher, K.M. (1990) “Progress in interior point algorithms since 1984”, SIAM News 3

Apostol, T.M. (1977) Calculus. Reverté, Barcelona, vol. II.

Bazaraa, M.S.; Jarvis, J.J.; Sherali, H. (1990) Linear Programming and Network Flows, 2nd Edition. John Wiley & Sons, New York.

Charnes, A.; Kortanek, K.O.; Raike, W. (1965) “Extreme point solution in mathematical programming: an opposite sign algorithm”, System Research Memorandum No.129, Northwestern University, Evanston

Golub, G.H.; Van Loan, C.F. (1989) Matrix Computations, 2nd Edition. The Johns Hopkins University Press, Baltimore.

Karmarkar, N. (1984) “A new polynomial-time algorithm for linear programming”, Combinatorica 4

Kortanek, K.O.; Jishan, Z. (1988) “New Purification algorithms for linear programming”, Naval Research Logistics Quaterly 35

Ye, Y. (1990) “Recovering optimal basic variables in Karmarkar polynomial algorithm for linear programming”, Mathematics of Operation Research 3

Comments

Downloads

Download data is not yet available.