39 lines
1.3 KiB
Plaintext
39 lines
1.3 KiB
Plaintext
Problem: szerelde
|
|
Rows: 4
|
|
Columns: 2
|
|
Non-zeros: 8
|
|
Status: OPTIMAL
|
|
Objective: arbevetel = 330 (MAXimum)
|
|
|
|
No. Row name St Activity Lower bound Upper bound Marginal
|
|
------ ------------ -- ------------- ------------- ------------- -------------
|
|
1 szerelesiido NS 60 60 = -1
|
|
2 gep1 NU 130 130 3
|
|
3 gep2 B 190 200
|
|
4 arbevetel B 330
|
|
|
|
No. Column name St Activity Lower bound Upper bound Marginal
|
|
------ ------------ -- ------------- ------------- ------------- -------------
|
|
1 T1 B 10 0
|
|
2 T2 B 25 0
|
|
|
|
Karush-Kuhn-Tucker optimality 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
|
|
|
|
KKT.DE: max.abs.err = 0.00e+00 on column 0
|
|
max.rel.err = 0.00e+00 on column 0
|
|
High quality
|
|
|
|
KKT.DB: max.abs.err = 0.00e+00 on row 0
|
|
max.rel.err = 0.00e+00 on row 0
|
|
High quality
|
|
|
|
End of output
|