Improving complexity of Karmarkar's approach for linear programming
In this paper, we are interested in the performance of Karmarkar's projective algorithm for linear programming. Based on the work of Schrijver, we offer a new displacement step better than Schrijver's one which led to a moderate improvement in the behavior of the algorithm shift. We show l...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Publishing House of the Romanian Academy
2014-08-01
|
| Series: | Journal of Numerical Analysis and Approximation Theory |
| Subjects: | |
| Online Access: | https://ictp.acad.ro/jnaat/journal/article/view/1026 |