| Article ID: | iaor1990697 |
| Country: | United States |
| Volume: | 37 |
| Start Page Number: | 1 |
| End Page Number: | 7 |
| Publication Date: | Apr 1988 |
| Journal: | Soviet Mathematics Doklady |
| Authors: | Nemirovskii A.S. . |
In this note a new PLP-algorithm is constructed. The estimates of its complexity are somewhat worse that those of Karmarkar’s method; however, this does not mean that the actual behavior of our method will also turn out to be worse (after all, the estimates of complexity of Karmarkar’s method are worse than those of Khachiyan’s method for typical cases, while the actual situation turns out to be the opposite).