exercise3.gms

$onText
Laboratory 1 - MOS
Exercise 3

Made by:
Juan Andrés Romero C - 202013449
Juan Sebastián Alegría - 202011282
$offText

Sets i 'Origin CPUs'      /i1, i2, i3/
     j 'Destination CPUs' /j1, j2, j3, j4/;
     
Parameter a(i) 'Amount of processes supplied by origin'    /i1 300, i2 500, i3 200/;
Parameter b(j) 'Amount of processes needed by destination' /j1 200, j2 300, j3 100, j4 400/;
     
Table t(i, j) 'Transmission costs between CPUs'

     j1 j2 j3 j4
 i1   8  6 10  9
 i2   9 12 13  7
 i3  14  9 16  5;
 
Variables x(i,j) 'Amount of sent process per path'
          z      'Target Function';
    
Positive Variable x;
    
Equations targetFunc            'Target Function'
          maxProcessesSent(i)   'Maximum amount of processes sent per origin CPU'
          satisfiedCPUDemand(j) 'Satisfied destination CPU process demand';
    
targetFunc..            z =e= sum((i,j), t(i,j)*x(i,j));
maxProcessesSent(i)..   sum((j), x(i,j)) =l= a(i);
satisfiedCPUDemand(j).. sum((i), x(i,j)) =e= b(j);

Model Exercise3 /all/;
option MIP=CPLEX;
Solve Exercise3 using mip minimizing z;
Display x.l;