Solving the model
Prerequisites
- The Model is solved
Get the solution
- Information about Solution retrieval
The resulting output
For better understanding we visualized the output below. The knapsack has an optimal value of 83 with items A,B,C,F,G and H.
By solving the model we generate the following output:
Optimize a model with 1 rows, 8 columns and 8 nonzeros
Coefficient statistics:
Matrix range [1e+00, 4e+00]
Objective range [8e+00, 2e+01]
Bounds range [1e+00, 1e+00]
RHS range [1e+01, 1e+01]
Found heuristic solution: objective -69
Presolve time: 0.00s
Presolved: 1 rows, 8 columns, 8 nonzeros
Variable types: 0 continuous, 8 integer (8 binary)
Root relaxation: objective -8.300000e+01, 1 iterations, 0.02 seconds
Nodes | Current Node | Objective Bounds | Work
Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time
* 0 0 0 -83.0000000 -83.00000 0.00% - 0s
Explored 0 nodes (1 simplex iterations) in 0.20 seconds
Thread count was 4 (of 4 available processors)
Optimal solution found (tolerance 0.00e+00)
Best objective -8.300000000000e+01, best bound -8.300000000000e+01, gap 0.0%
[Sum of all item]values, 83]
Status of item Item A_B : 1
Status of item Item B_C : 1
Status of item Item C_D : 1
Status of item Item D_E : 0
Status of item Item E_F : 0
Status of item Item F_G : 1
Status of item Item G_H : 1
Status of item Item H_I : 1
Next Step
- Here you can find even more Models