| Issue |
RAIRO-Oper. Res.
Volume 35, Number 4, October December 2001
|
|
|---|---|---|
| Page(s) | 395 - 399 | |
| DOI | https://doi.org/10.1051/ro:2001121 | |
| Published online | 15 August 2002 | |
A modified algorithm for the strict feasibility problem
Département de Mathématiques, Faculté des
Sciences, Université
Ferhat Abbas, Sétif, 19000 Algérie.
Received:
September
2001
In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.
Key words: Strict feasibility / interior point methods / Ye–Lustig algorithm.
© EDP Sciences, 2001
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.