A wide neighborhood infeasible-interior-point method with arc-search for linear programming
| العنوان: | A wide neighborhood infeasible-interior-point method with arc-search for linear programming |
|---|---|
| المؤلفون: | Ximei Yang, Hongwei Liu, Yinkui Zhang |
| المصدر: | Journal of Applied Mathematics and Computing. 51:209-225 |
| بيانات النشر: | Springer Science and Business Media LLC, 2015. |
| سنة النشر: | 2015 |
| مصطلحات موضوعية: | Mathematical optimization, 021103 operations research, Linear programming, Applied Mathematics, 010102 general mathematics, 0211 other engineering and technologies, 02 engineering and technology, Ellipse, 01 natural sciences, Linear-fractional programming, Arc (geometry), Computational Mathematics, Theory of computation, Path (graph theory), Criss-cross algorithm, 0101 mathematics, Interior point method, Mathematics |
| الوصف: | In this paper, we propose an arc-search infeasible-interior-point method for linear programming. The proposed algorithm is based on a wide neighborhood of the central path and searches the optimizers along the ellipses that approximate the entire the central path. We also establish polynomial complexity of the proposed algorithm. Finally, numerical experiments show that the proposed algorithm is efficient and reliable. |
| تدمد: | 1865-2085 1598-5865 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::e3f1f8b40706d2ed676f9438ee336f97 https://doi.org/10.1007/s12190-015-0900-z |
| حقوق: | CLOSED |
| رقم الأكسشن: | edsair.doi...........e3f1f8b40706d2ed676f9438ee336f97 |
| قاعدة البيانات: | OpenAIRE |
Find this article in full text from Springer Verlag. | تدمد: | 18652085 15985865 |
|---|