Authorization

 

Journal

Volume 2, №2


Definition of the narrow intervals for variables in the integer-valued knapsack problem (pages 156-160)
K.Sh. Mamedov


Abstract. The paper presents a method for decreasing the length of the giving intervals of variables in the integer valued knapsack problem. The method based on criteria, which formulated as a theorem of sufficiency. It is shown, that the coordinates of the optimal decision are included into the following intervals:

 Here, dj, (j=1,…n) is the upper bound of the variables, f and f are the upper and low bounds of the optimum of objective function accordingly, lj = cj –(ck/ak)aj; (j=1,…n), k- number of coordinate of optimal solution appropriate to the relaxation problem, which received the fractional value, cj and aj  (j=1,…n) are the coefficients of the objective function and  constraint accordingly. Computational experiments are shown the highly efficiency of the suggested method.



COIA 2027

7-9 July 2027
Baku, Azerbaijan

Search