Branch and Bound Method to Resolve Non-Convex Quadratic Problems Over a Boxed Set

  • Authors

    • Boutheina Gasmi
    • Rachid Benacer
    2018-11-30
    https://doi.org/10.14419/ijet.v7i4.26.27939
  • Non Convex Quadratic Programing, Global Optimization, Optimization Methods, Branch and Bound Method, Belinear 0-1 programing.

  • Abstract

    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.

     

  • References

    1. [1] Gasmi.B, contriution `a l’´etude des M´ethodes de r ´esoluion des probl`emes d’optimiations quadratiques. th`ese de magister (2007).

      [2] G.A. Anastassiou and O. Duman, Intelligent mathematics II, Applied mathematics and approximation theory. Vol 441, DOI 10.10070/978-3-319-30322-2 7, (2016) pp 105-117 .

      [3] Hongwei Jiao, a Branch and Bound algorithm for globally solving a class of non convex programming problems, Non linear analysis 70 (2009) pp 1113-1123 .

      [4] Panos. M. Pardalos, Global optimization algorithms for linearly constrained indefinite quadratic problems, Computers math app lic. Vol. 21, NO 6/7, (1991) pp 87-97 .

      [5] Reiner Horst. Panous. M. Pardalos and Ngugen V. Thoai, Introduction to global optimization. Kluwer academic publishers. Dord Echt/ Boston/ London. Volume 3.(1995).

      [6] Xue Honggang, Xu Chengxian, A Branch and Bound algorithm for solving a class of DC-Programming. Applied mathematics and computation 165 ,(2005) pp 291-302 .

      [7] Yuelin Gao, Honggang Xue, Peiping Shen, A new rectangle Branch and Bound reduce approch for solving non convex quadratique programming problems, Applied mathemetics and computation 168 (2005), pp 1409-1418.

  • Downloads

  • How to Cite

    Gasmi, B., & Benacer, R. (2018). Branch and Bound Method to Resolve Non-Convex Quadratic Problems Over a Boxed Set. International Journal of Engineering & Technology, 7(4.26), 288-296. https://doi.org/10.14419/ijet.v7i4.26.27939

    Received date: 2019-02-25

    Accepted date: 2019-02-25

    Published date: 2018-11-30