کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
480950 | 1446154 | 2009 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions](/preview/png/480950.png)
چکیده انگلیسی
To solve linear programming problems by interior point methods an approximately centered interior point has to be known. Such a point can be found by an algorithmic approach – a so-called phase 1 algorithm or centering algorithm. For random linear programming problems distributed according to the rotation symmetry model, especially with normal distribution, we present probabilistic results on the quality of the origin as starting point and the average number of steps of a centering algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 194, Issue 2, 16 April 2009, Pages 377–389
Journal: European Journal of Operational Research - Volume 194, Issue 2, 16 April 2009, Pages 377–389
نویسندگان
Petra Huhn, Verena Wehlitz,