Open AccessBranch and Bound Method to Resolve Non-Convex Quadratic Problems Over a Boxed Set
Author(s) -
Boutheina Gasmi,
Rachid Benacer
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.26.27939
Subject(s) - quadratic equation , ideal (ethics) , regular polygon , set (abstract data type) , upper and lower bounds , mathematical optimization , computer science , branch and bound , quadratic programming , mathematics , algorithm , law , geometry , political science , mathematical analysis , programming language
We present in this paper the technique Branch and Bound with new quadratic approch over a boxed arrangement of Rn. We develop an inexact arched quadratic capacity of the target capacity to decide a lower bound of the worldwide ideal estimation of the first non raised issue (NQP) over every subset of this boxed set. We connected a segment and specialized lessening on the feasable area of (NQP)to quicken the intermingling of the proposed calculation. Finally,we think about the assembly of the proposed calculation and we give a straightforward examination between this strategy and another technique wish have a similar guideline.