Begin

gyakorlatok/szendvicsek.out

@@ -0,0 +1,32 @@
+Problem:    szendvicsek
+Rows:       5
+Columns:    2 (2 integer, 0 binary)
+Non-zeros:  8
+Status:     INTEGER OPTIMAL
+Objective:  szendvicsekszama = 65 (MAXimum)
+
+   No.   Row name        Activity     Lower bound   Upper bound
+------ ------------    ------------- ------------- -------------
+     1 vaj                       220                         220 
+     2 tojas                     170                         170 
+     3 szalami                    80                         100 
+     4 sonka                      25                          40 
+     5 szendvicsekszama
+                                  65                             
+
+   No. Column name       Activity     Lower bound   Upper bound
+------ ------------    ------------- ------------- -------------
+     1 sonkas       *             25             0               
+     2 szalamis     *             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