Transportation-problem/transmeth.m at main · VictoriaSedig/Transportation-problem · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

%%% Making all the matrices

% Defining our active x for the constraints
A = [-1 0 0 0 -1 0 0 0 -1 0 0 0;
    0 -1 0 0 0 -1 0 0 0 -1 0 0;
    0 0 -1 0 0 0 -1 0 0 0 -1 0;
    0 0 0 -1 0 0 0 -1 0 0 0 -1;
    1 1 1 1 0 0 0 0 0 0 0 0;
    0 0 0 0 1 1 1 1 0 0 0 0;
    0 0 0 0 0 0 0 0 1 1 1 1];

%RHS of the constraint
b = [-15 -45 -30 -25 25 55 35]; %%%%% The 6th number is run for 55 but 60 in task 4

% Obj func
f = [10 0 20 11 12 7 9 20 0 14 16 18];
lb = [0 0 0 0 0 0 0 0 0 0 0 0];
ub = [inf inf inf inf inf inf inf inf inf inf inf inf];

% Linprog with interior point method
options = optimoptions('linprog','Algorithm','interior-point','display','iter');
x_interiorpoint = linprog(f,A,b,[], [], lb, ub, options);

%Linprog with simplex method
options = optimoptions('linprog','Algorithm','dual-simplex','display','iter');
x_simplex = linprog(f,A,b,[], [], lb, ub, options);