K.SH. MAMMADOV, N.O. MAMMADLI
METHODS OF CONSTRUCTING SUBOPTIMISTIC AND SUBPESSIMISTIC SOLUTIONS OF MIXED-BOOLEAN KNAPSACK PROBLEM WITH INTERVAL DATA
The authors introduce the concepts of optimistic, pessimistic, suboptimistic and subpessimistic solutions of mixed-Boolean knapsack problem with interval data. For this problem, methods of constructing of suboptimistic and subpessimistic solutions are developed. These methods are based on some economic interpretation of considered problem. Computational experiments for different large-scale problems with random coefficients show high efficiency of developed methods again.
Keywords: mixed-Boolean knapsack problem with interval data, suboptimistic and subpessimistic solutions, upper and low bounds
METHODS OF CONSTRUCTING SUBOPTIMISTIC AND SUBPESSIMISTIC SOLUTIONS OF MIXED-BOOLEAN KNAPSACK PROBLEM WITH INTERVAL DATA
The authors introduce the concepts of optimistic, pessimistic, suboptimistic and subpessimistic solutions of mixed-Boolean knapsack problem with interval data. For this problem, methods of constructing of suboptimistic and subpessimistic solutions are developed. These methods are based on some economic interpretation of considered problem. Computational experiments for different large-scale problems with random coefficients show high efficiency of developed methods again.
Keywords: mixed-Boolean knapsack problem with interval data, suboptimistic and subpessimistic solutions, upper and low bounds