چکیده مقاله
In this paper the problem of computing optimal value of an interval quadratic programming is considered In spite of all existing researches, this paper focuses on constraint interval concept While the idea has been already applied by the authors to interval linear system and interval linear programming, contrary to the previous results, we present a novel methodology to deal with an interval nonlinear programming problems The problem is constrained to linear equalities and without sign restricted variables Due to NP hardness of the problem, we convert the original problem into a relaxed form which is technically converted into an interval linear system, then an approximation algorithm is applied
کلیدواژهها
نویسندگان
M. Keyanpour
Department of Mathematics, Faculty of Sciences, University of Guilan, Iran;
M Mohaghegh Tabar
Department of Sciences, Fouman and Shaft Branch, Islamic Azad University, Iran;
شیوه ارجاع
Keyanpour, M. and Mohaghegh Tabar, M,1398,Interval Quadratic Linear Programming in The Presence of Constraint Interval,3rd International Conference on Soft Computing,Rudsar
ارائهشده در
مجموعه مقالات سومین کنفرانس بین المللی محاسبات نرم29 آبان 1398 · رودسر