N.O. Mammadli
An algorithm for the construction of suboptimistic and subpessimistic solutions of a mixed integer knapsack problem with interval data

In the mixed-integer knapsack problem with interval data the concepts of admissible, optimistic, pessimistic, suboptimistic and subpessimistic solutions are introduced. The algorithms for their construction are developed. The programs of the developed algorithms are compiled and a number of computational experiments on large dimension problems are carried out. These experiments once again confirm the high quality of the developed methods.

Keywords: Interval knapsack problem of mixed-integer programming, Admissible solution, Optimistic, pessimistic, suboptimistic and subpessimistic solutions, Upper and lower bounds Computational experiments, Errors