Begin

gyakorlatok/froccs_kieg_2.out

@@ -0,0 +1,39 @@
+Problem:    froccs_kieg_2
+Rows:       3
+Columns:    10 (10 integer, 0 binary)
+Non-zeros:  30
+Status:     INTEGER OPTIMAL
+Objective:  TotalIncome = 208320 (MAXimum)
+
+   No.   Row name        Activity     Lower bound   Upper bound
+------ ------------    ------------- ------------- -------------
+     1 UseIngredietns[Wine]
+                                1000                        1000 
+     2 UseIngredietns[Soda]
+                                1500                        1500 
+     3 TotalIncome            208320                             
+
+   No. Column name       Activity     Lower bound   Upper bound
+------ ------------    ------------- ------------- -------------
+     1 Sale[kf]     *            832             0               
+     2 Sale[nf]     *              0             0               
+     3 Sale[hl]     *              2             0               
+     4 Sale[hm]     *              0             0               
+     5 Sale[vh]     *              0             0               
+     6 Sale[krf]    *              0             0               
+     7 Sale[sf]     *              0             0               
+     8 Sale[pf]     *              0             0               
+     9 Sale[hu]     *              0             0               
+    10 Sale[lf]     *            166             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