A Branch and Bound Reduced Algorithm for Quadratic Programming Problems with Quadratic Constraints

Table 1

Example	The optimal solution within accuracy or one solution among solutions
	𝑥1	𝑥2	𝑥3	𝑥4	𝑥5
1	2.0000	1.6667
2	2.5576	3.1279
3	2.0000	1.6667
4	1.0000	5.5000
5	1.5000	1.2247
6	1.0156	1.5594
7	0.4267	0.5879
8	78.0000	33.0001	29.9958	44.9998	36.7753
Example	Approximate optimal value		Iterations	CPU (s)
1	6.7778		33	8.301128
2	118.3837		49	32.696565
3	6.7778		29	6.676444
4	1.0000		9	3.162106
5	−1.1629		17	4.429806
6	−31.8878		130	54.024140
7	−3.3304		20	5.410943
8	10128		98	193.921992