====== Lineární programování 1 ======
===== Jistá výhra =====
Tenhle skript:

  f = [0, 0, 0, 0, 0, 1];
  A = [ -1.27, -1.02,     0,     0,    0,   -1; 
            0, -1.02, -4.70, -3.09,    0,   -1; 
            0,     0,     0, -3.09,   -9,   -1; 
            1,     1,     1,     1,    1,    0; 
           -1,    -1,    -1,    -1,   -1,    0; 
           -1,     0,     0,     0,    0,    0; 
            0,    -1,     0,     0,    0,    0; 
            0,     0,    -1,     0,    0,    0; 
            0,     0,     0,    -1,    0,    0; 
            0,     0,     0,     0,   -1,    0;	]; 
  b = [  0;
         0;
         0;
      3000;
     -3000;
         0;
         0;
         0;
         0;
         0; ];
  x = linprog(f,A,b)
  checksum = sum(x(1:5))
  win = min( [[1.27, 1.02, 0.00, 0.00, 0.00, 0.00] * x
              [0.00, 1.02, 4.70, 3.09, 0.00, 0.00] * x
              [0.00, 0.00, 0.00, 3.09, 9.00, 0.00] * x ])

Vraci vysledky: 

  Optimization terminated.
  x =
   1.0e+03 *
    0.0000
    2.6946
    0.0000
    0.0000
    0.3054
   -2.7485
  checksum =
   3.0000e+03
  win =
   2.7485e+03

~~DISCUSSION~~