proc optmodel;/*zadanie 4 s.195*/
num m=2;
num n=3;
num c{i in 1..m, j in 1..n}=[
7   2   1
1   4   6
];
num wsp{i in 0..m, j in 1..n}=[
80 60 50
-8 -8 --4
0.25 0.5 0.2
];
num podaz{i in 1..m}=[15 15];
var x{i in 1..m, j in 1..n} >=0;
var z{j in 1..n} >=0;
min koszt=sum{i in 1..m, j in 1..n}c[i,j]*x[i,j]
+sum{j in 1..n}(wsp[0,j]+wsp[1,j]*z[j]+wsp[2,j]*z[j]**2);
con warPodaz{i in 1..m}: sum{j in 1..n}x[i,j]<=podaz[i];
con warPopyt{j in 1..n}: sum{i in 1..m}x[i,j]=z[j];
solve;
print x z;
quit;