32 lines
1.1 KiB
Plaintext
32 lines
1.1 KiB
Plaintext
Problem: szendvicsek
|
|
Rows: 5
|
|
Columns: 2 (2 integer, 0 binary)
|
|
Non-zeros: 8
|
|
Status: INTEGER OPTIMAL
|
|
Objective: szenvicsek = 70 (MAXimum)
|
|
|
|
No. Row name Activity Lower bound Upper bound
|
|
------ ------------ ------------- ------------- -------------
|
|
1 szalami 60 100
|
|
2 sonka 40 40
|
|
3 tojas 170 170
|
|
4 vaj 50 216
|
|
5 szenvicsek 70
|
|
|
|
No. Column name Activity Lower bound Upper bound
|
|
------ ------------ ------------- ------------- -------------
|
|
1 szalamis * 30 0
|
|
2 sonkas * 40 0
|
|
|
|
Integer feasibility conditions:
|
|
|
|
KKT.PE: max.abs.err = 0.00e+00 on row 0
|
|
max.rel.err = 0.00e+00 on row 0
|
|
High quality
|
|
|
|
KKT.PB: max.abs.err = 0.00e+00 on row 0
|
|
max.rel.err = 0.00e+00 on row 0
|
|
High quality
|
|
|
|
End of output
|