K.SH. MAMEDOV, N.N. MAMEDOV
THE CONCEPT OF GUARANTEED SOLUTION AND GUARANTEED SUBOPTIMAL SOLUTION WITH RESPECT TO THE FUNCTIONAL IN THE INTEGER KNAPSACK PROBLEM AND ITS CONSTRUCTION


The concept of guaranteed solution and guaranteed suboptimal solution with respect to the functional in the integer knapsack problem is introduced. An algorithm is developed for a minimum change in the coefficients of the objective function, which guarantees finding a solution that ensures that the value of the function is not less than the fixed value. One numerical example was solved with the use of this algorithm.

Keywords: Knapsack problem, suboptimal solution, guaranteed solution, guaranteed suboptimal solution
© Copyright.
Copyright © 1997-2019 Institute of Control Systems of Azerbaijan National Academy of Sciences. e-Mail: [email protected]