کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1131485 | 955638 | 2012 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Non-convex mixed-integer nonlinear programming: A survey
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are available. When non-convexities are present, however, things become much more difficult, since then even the continuous relaxation is a global optimization problem. We survey the literature on non-convex MINLPs, discussing applications, algorithms, and software. Special attention is paid to the case in which the objective and constraint functions are quadratic.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Surveys in Operations Research and Management Science - Volume 17, Issue 2, July 2012, Pages 97–106
Journal: Surveys in Operations Research and Management Science - Volume 17, Issue 2, July 2012, Pages 97–106
نویسندگان
Samuel Burer, Adam N. Letchford,