A.H. MAMMADOVA
CONSTRUCTION OF SUBPESSIMISTIC AND SUBOPTIMISTIC SOLUTION IN KNAPSACK PROBLEM WITH WHOLE COEFFICIENTS ARE SITUATED IN THE RANGE
In this work it is offered notions of optimist solution, pessimistic solution, subpessimistic and suboptimistic solution for Knapsack problem which coefficients are situated in integer range. In addition are estimated errors of finding solution of optimist and pessimist solutions. Constituted programs of suggested algorithms and carried out large computational experiments.
Keywords: Knapsack problem which coefficients are situated in integer range, optimist solution, pessimistic solution, subpessimistic solution, suboptimistic solution, absolute and relative error
CONSTRUCTION OF SUBPESSIMISTIC AND SUBOPTIMISTIC SOLUTION IN KNAPSACK PROBLEM WITH WHOLE COEFFICIENTS ARE SITUATED IN THE RANGE
In this work it is offered notions of optimist solution, pessimistic solution, subpessimistic and suboptimistic solution for Knapsack problem which coefficients are situated in integer range. In addition are estimated errors of finding solution of optimist and pessimist solutions. Constituted programs of suggested algorithms and carried out large computational experiments.
Keywords: Knapsack problem which coefficients are situated in integer range, optimist solution, pessimistic solution, subpessimistic solution, suboptimistic solution, absolute and relative error