Hostname: page-component-848d4c4894-jbqgn Total loading time: 0 Render date: 2024-07-05T07:53:24.338Z Has data issue: false hasContentIssue false
  • English
  • Français

A modified algorithm for the strict feasibility problem

Published online by Cambridge University Press:  15 August 2002

D. Benterki  and
B. Merikhi
D. Benterki
Affiliation:
Département de Mathématiques, Faculté des Sciences, Université Ferhat Abbas, Sétif, 19000 Algérie.
B. Merikhi
Affiliation:
Département de Mathématiques, Faculté des Sciences, Université Ferhat Abbas, Sétif, 19000 Algérie.
Get access

Abstract

In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.

Keywords

Strict feasibilityinterior point methodsYe–Lustig algorithm.
Type
Research Article
Information
RAIRO - Operations Research , Volume 35 , Issue 4 , October 2001 , pp. 395 - 399
Copyright
© EDP Sciences, 2001

Access options

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.)

References

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).
J.C. Culioli, Introduction à l'optimisation. Édition Marketing, Ellipses, Paris (1994).
I.J. Lustig, A pratical approach to Karmarkar's algorithm. Technical report sol 85-5, Department of Operations Research Stanford University, Stanford, California.
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).
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
S.J. Wright, Primal-dual interior point method. SIAM, Philadelphia, PA (1997).