کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4637057 | 1340733 | 2006 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem](/preview/png/4637057.png)
چکیده انگلیسی
We present a smoothing-type algorithm for solving the linear program (LP) by making use of an augmented system of its optimality conditions. The algorithm is shown to be globally convergent without requiring any assumption. It only needs to solve one system of linear equations and to perform one line search at each iteration. In particular, if the LP has a solution (and hence it has a strictly complementary solution), then the algorithm will generate a strictly complementary solution of the LP; and if the LP is infeasible, then the algorithm will correctly detect infeasibility of the LP. To the best of our knowledge, this is the first smoothing-type algorithm for solving the LP having the above desired convergence features.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 177, Issue 1, 1 June 2006, Pages 330–345
Journal: Applied Mathematics and Computation - Volume 177, Issue 1, 1 June 2006, Pages 330–345
نویسندگان
Zheng-Hai Huang, Hui Wang,