|
|||||
|
|
On the probabilistic complexity of finding an approximate solution for linear programming |
|
| Authors: | Jun Ji Florian A. Potra |
| Affiliation: | 1. Department of Mathematics, Kennesaw State University, Kennesaw, GA 30144, USA;2. Department of Mathematics and Statistics, University of Maryland, Baltimore County, Baltimore, MD 21250, USA |
| Abstract: | |
| Keywords: | Linear programming Interior-point algorithm Average complexity Approximate solution |
| 本文献已被 ScienceDirect 等数据库收录！ | |