Optimal values range of interval polynomial programming problems | ||
| International Journal of Nonlinear Analysis and Applications | ||
| مقاله 158، دوره 13، شماره 1، خرداد 2022، صفحه 1917-1929 اصل مقاله (399.43 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22075/ijnaa.2021.23797.2611 | ||
| نویسندگان | ||
| Somayeh Amirmahmoodi؛ Hassan Mishmast Nehi* ؛ Mehdi Allahdadi | ||
| Mathematics Faculty, University of Sistan and Baluchestan, Zahedan, Iran | ||
| چکیده | ||
| Uncertainty exists in many real-life engineering and mechanical problems. Here, we assume that uncertainties are caused by intervals of real numbers. In this paper, we consider the interval nonlinear programming (INLP) problems where the objective function and constraints include interval coefficients. So that the variables are deterministic and sign-restricted. Additionally, the constraints are considered in the form of inequalities. A basic task in INLP is calculating the optimal values range of objective function, which may be computationally very expensive. However, if the boundary functions are available, the problems become much easier to solve. By making these assumptions, an efficient method is proposed to compute the optimal values range using two classic nonlinear problems. Then, the optimal values range are obtained by direct inspection for a special kind of interval polynomial programming (IPP) problems. Two numerical examples are given to verify the effectiveness of the proposed method. | ||
| کلیدواژهها | ||
| Interval uncertainty؛ Interval nonlinear programming؛ Optimal values range؛ Interval polynomial؛ Boundary functions | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 16,377 تعداد دریافت فایل اصل مقاله: 9,696 |
||
| تعداد نشریات | 22 |
| تعداد شمارهها | 722 |
| تعداد مقالات | 10,383 |
| تعداد مشاهده مقاله | 72,838,495 |
| تعداد دریافت فایل اصل مقاله | 64,534,994 |