38 lines
1.5 KiB
Plaintext
38 lines
1.5 KiB
Plaintext
Problem: froccs
|
|
Rows: 3
|
|
Columns: 10 (10 integer, 0 binary)
|
|
Non-zeros: 30
|
|
Status: INTEGER OPTIMAL
|
|
Objective: arbevetel = 208200 (MAXimum)
|
|
|
|
No. Row name Activity Lower bound Upper bound
|
|
------ ------------ ------------- ------------- -------------
|
|
1 bor 100 100
|
|
2 szoda 150 150
|
|
3 arbevetel 208200
|
|
|
|
No. Column name Activity Lower bound Upper bound
|
|
------ ------------ ------------- ------------- -------------
|
|
1 kf * 82 0
|
|
2 nf * 0 0
|
|
3 hl * 2 0
|
|
4 hm * 0 0
|
|
5 vh * 0 0
|
|
6 krf * 0 0
|
|
7 sf * 0 0
|
|
8 pf * 0 0
|
|
9 hu * 0 0
|
|
10 lf * 16 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
|