32 lines
1.1 KiB
Plaintext
32 lines
1.1 KiB
Plaintext
Problem: csarnok
|
|
Rows: 5
|
|
Columns: 2 (2 integer, 0 binary)
|
|
Non-zeros: 10
|
|
Status: INTEGER OPTIMAL
|
|
Objective: nyereseg = 32000 (MAXimum)
|
|
|
|
No. Row name Activity Lower bound Upper bound
|
|
------ ------------ ------------- ------------- -------------
|
|
1 lemez 32000 32000
|
|
2 acel 21 24
|
|
3 tetofedo 1700 2000
|
|
4 beton 1000 1600
|
|
5 nyereseg 32000
|
|
|
|
No. Column name Activity Lower bound Upper bound
|
|
------ ------------ ------------- ------------- -------------
|
|
1 a * 3 0
|
|
2 b * 4 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
|