Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)
Article purchase
Temporarily unavailable
References
[1]
D. Benterki, Étude des performances de l'algorithme de Karmarkar pour la programmation linéaire. Thèse de Magister, Département de Mathématiques, Université de Annaba, Algérie (1992).
[2]
J.C. Culioli, Introduction à l'optimisation. Édition Marketing, Ellipses, Paris (1994).
[3]
I.J. Lustig, A pratical approach to Karmarkar's algorithm. Technical report sol 85-5, Department of Operations Research Stanford University, Stanford, California.
[4]
A. Keraghel, Étude adaptative et comparative des principales variantes dans l'algorithme de Karmarkar, Thèse de Doctorat de mathématiques appliquées. Université Joseph Fourier, Grenoble, France (1989).
[5]
Shanno, D.F. and Marsten, R.E., A reduced-gradient variant of Karmarkar's algorithm and null-space projections. J. Optim. Theory Appl.57 (1988) 383-397.
CrossRef
[6]
S.J. Wright, Primal-dual interior point method. SIAM, Philadelphia, PA (1997).