-
Notifications
You must be signed in to change notification settings - Fork 5
/
test_cases_1b.m
333 lines (241 loc) · 10.1 KB
/
test_cases_1b.m
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
classdef test_cases_1b < matlab.unittest.TestCase
methods(Test)
function cocktail(testCase)
% As seen in tutorial.
m = 3;
n = 5;
A = [0.08 0.06 1 0 0;
1 0 0 1 0;
0 1 0 0 1];
c = [-2 -1.25 0 0 0]';
b = [12 120 120]';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
testCase.verifyEqual(z,-290, AbsTol = 1e-5);
testCase.verifyEqual(x,[40,120,80].', AbsTol = 1e-5);
testCase.verifyEqual(pi,[-125/6, -1/3, 0].', AbsTol = 1e-5);
testCase.verifyEqual(ind,[2,1,5].', AbsTol = 1e-5);
testCase.verifyEqual(exitflag,0, AbsTol = 1e-5);
end
function cocktail_unbounded(testCase)
% Unbounded cocktail problem as seem in tutorial
m = 3;
n = 5;
A = [0.08 0.06 -1 0 0;
1 0 0 -1 0;
0 1 0 0 -1];
c = [-2 -1.25 0 0 0]';
b = [12 120 120]';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
% Don't think we need all return values to be exact here as
% long as exitflag = -1. But why not...
% testCase.verifyEqual(z,0, AbsTol = 1e-5);
% testCase.verifyEqual(x,[-12,-120,-120].', AbsTol = 1e-5);
% testCase.verifyEqual(pi,[0, 0, 0].', AbsTol = 1e-5);
% testCase.verifyEqual(ind,[3,4,5].', AbsTol = 1e-5);
testCase.verifyEqual(exitflag,-1, AbsTol = 1e-5);
end
function another_cocktail_unbounded(testCase)
% Unbounded cocktail problem as seem in tutorial
m = 3;
n = 5;
A = [0.08 0.06 -1 0 0;
1 0 0 -1 0;
0 1 0 0 -1];
c = [-2 -1.25 0 0 0]';
b = [12 60 60]';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
% Don't think we need all return values to be exact here as
% long as exitflag = -1. But why not...
testCase.verifyEqual(exitflag,-1, AbsTol = 1e-5);
end
function Assignment_1_Q3(testCase)
m = 3;
n = 6;
A = [1 1 1 1 0 0;
1 2 2 -1 1 0;
1 2 1 0 -1 1];
c = [15 10 -10 1 2 3]';
b = [4 4 4]';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
testCase.verifyEqual(z,-64/3, AbsTol = 1e-5);
testCase.verifyEqual(x,[8/3,4/3,4/3].', AbsTol = 1e-5);
testCase.verifyEqual(pi,[-11/3, -14/3, 3].', AbsTol = 1e-5);
testCase.verifyEqual(ind,[3,6,4].', AbsTol = 1e-5);
testCase.verifyEqual(exitflag,0, AbsTol = 1e-5);
end
function Assignment_1_Q4(testCase)
m = 2;
n = 5;
A = [1 2 3 1 -1;
2 1 4 -1 2];
c = [1 1 1 1 1]';
b = [4 6]';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
testCase.verifyEqual(z,8/5, AbsTol = 1e-5);
testCase.verifyEqual(x,[7/5,1/5].', AbsTol = 1e-5);
testCase.verifyEqual(pi,[-1/5,2/5].', AbsTol = 1e-5);
testCase.verifyEqual(ind,[3,5].', AbsTol = 1e-5);
testCase.verifyEqual(exitflag,0, AbsTol = 1e-5);
end
function Assignment_1_Q4_redundant_constraint(testCase)
m = 3;
n = 5;
A = [1 2 3 1 -1;
2 1 4 -1 2;
2 1 4 -1 2];
c = [1 1 1 1 1]';
b = [4 6 6]';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
testCase.verifyEqual(z,8/5, AbsTol = 1e-5);
testCase.verifyEqual(x,[7/5,1/5,0].', AbsTol = 1e-5);
testCase.verifyEqual(ind,[3,5,8].', AbsTol = 1e-5);
testCase.verifyEqual(exitflag,0, AbsTol = 1e-5);
end
function Assignment_1_Q4_redundant_constraint_2(testCase)
m = 3;
n = 5;
A = [1 2 3 1 -1;
2 1 4 -1 2;
1 2 1 1 -2];
c = [1 1 1 1 1]';
b = [4 6 1]';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
testCase.verifyEqual(z,8/5, AbsTol = 1e-5);
% testCase.verifyEqual(x,[7/5,1/5,0].', AbsTol = 1e-5);
% testCase.verifyEqual(pi,[-1/5,2/5].', AbsTol = 1e-5);
% testCase.verifyEqual(ind,[3,5,8].', AbsTol = 1e-5);
testCase.verifyEqual(exitflag,0, AbsTol = 1e-5);
end
function lecture_example(testCase)
m = 2;
n = 4;
A = [3, 2, 2, 1;
3, 4, 1, 2];
c = [-3, -2, -1, -1]';
b = [8, 7]';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
testCase.verifyEqual(z,-7, AbsTol = 1e-5);
testCase.verifyEqual(x,[1, 2].', AbsTol = 1e-5);
testCase.verifyEqual(pi,[0, -1].', AbsTol = 1e-5);
testCase.verifyEqual(ind,[3, 1].', AbsTol = 1e-5);
testCase.verifyEqual(exitflag,0, AbsTol = 1e-5);
end
function another_degenerate(testCase)
m = 4;
n = 6;
A = [0.08 0.06 1 0 0 0;
0.06 0.06 0 1 0 0;
0 1 0 0 1 0;
2 1 0 0 0 1];
c = [-2 -1.25 0 0 0 0]';
b = [12 9.6 120 280]';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
% Don't think we need all return values to be exact here as
% long as exitflag = -1. But why not...
testCase.verifyEqual(z,-290, AbsTol = 1e-5);
testCase.verifyEqual(x,[40, 0, 80, 120].', AbsTol = 1e-5);
testCase.verifyEqual(pi,[-12.5, 0, 0, -0.5].', AbsTol = 1e-5);
testCase.verifyEqual(ind,[2,4,5,1].', AbsTol = 1e-5);
testCase.verifyEqual(exitflag,0, AbsTol = 1e-5);
end
function cocktail_degenerate(testCase)
% Unbounded cocktail problem as seem in tutorial
m = 3;
n = 5;
A = [0.08 0.06 1 0 0;
1 0 0 1 0;
0 1 0 0 1];
c = [-7 -6 0 0 0]';
b = [10 125 120]';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
% Don't think we need all return values to be exact here as
% long as exitflag = -1. But why not...
testCase.verifyEqual(z,-965, AbsTol = 1e-5);
testCase.verifyEqual(x,[35,90,120].', AbsTol = 1e-5);
testCase.verifyEqual(pi,[-87.5, 0, -0.75].', AbsTol = 1e-5);
testCase.verifyEqual(ind,[1, 4, 2].', AbsTol = 1e-5);
testCase.verifyEqual(exitflag,0, AbsTol = 1e-5);
end
function Degen(testCase)
% Idk if this is right... from slides...
m = 3;
n = 5;
A = [0.08 0.06 1 0 0;
1 0 0 1 0;
0 1 0 0 1];
c = [-7 -6 0 0 0]';
b = [10 125 120]';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
% Don't think we need all return values to be exact here as
% long as exitflag = -1. But why not...
testCase.verifyEqual(z,-965, AbsTol = 1e-5);
testCase.verifyEqual(x,[35,90,120].', AbsTol = 1e-5);
testCase.verifyEqual(pi,[-87.5, 0, -0.75].', AbsTol = 1e-5);
testCase.verifyEqual(ind,[1, 4, 2].', AbsTol = 1e-5);
testCase.verifyEqual(exitflag,0, AbsTol = 1e-5);
end
function Assignment_1_Q5(testCase)
% problem from assignment
m = 2;
n = 5;
A = [1 2 3 1 -1;
2 1 4 -1 2];
b = [4 6].';
c = [1 1 1 1 1].';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
testCase.verifyEqual(z,1.6, AbsTol = 1e-5);
testCase.verifyEqual(exitflag,0, AbsTol = 1e-5);
end
function Tutorial_2_Q1(testCase)
% problem from tut
m = 4;
n = 6;
A = [2 4 1 0 0 0;
4 4 0 1 0 0;
6 3 0 0 1 0;
-4 3 0 0 0 1];
b = [16 20 24 6].';
c = [-3 -2 0 0 0 0].';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
testCase.verifyEqual(z,-13, AbsTol = 1e-5);
testCase.verifyEqual(x,[3,12,2,2].', AbsTol = 1e-5);
testCase.verifyEqual(pi,[0,-0.25,-1/3,0].', AbsTol = 1e-5);
testCase.verifyEqual(ind,[1,6,3,2].', AbsTol = 1e-5);
testCase.verifyEqual(exitflag,0, AbsTol = 1e-5);
end
function Tutorial_2_Q2(testCase)
% problem from tut
m = 3;
n = 6;
A = [1 1 1 1 0 0;
0 1 0 -1 1 0;
1 0 -1 0 -1 1];
b = [4 4 4].';
c = [15 10 -10 1 2 3].';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
testCase.verifyEqual(z,4, AbsTol = 1e-5);
testCase.verifyEqual(x,[4,4,12].', AbsTol = 1e-5);
testCase.verifyEqual(pi,[-7,5,3].', AbsTol = 1e-5);
testCase.verifyEqual(ind,[3,5,6].', AbsTol = 1e-5);
testCase.verifyEqual(exitflag,0, AbsTol = 1e-5);
end
function Redundant_Online_Example(testCase)
m = 3;
n = 4;
A = [1 2 0 1;
2 1 1 0;
-1 4 -2 3];
b = [20 10 40].';
c = [1 4 1 2].';
[z,x,pi,ind,exitflag] = fullsimplex(A,b,c,m,n);
testCase.verifyEqual(z,35, AbsTol = 1e-5); % not too sure about the answers tbh
testCase.verifyEqual(x,[5,0, 15].', AbsTol = 1e-5);
% testCase.verifyEqual(pi,[-7,5,3].', AbsTol = 1e-5); % ceebs
% calculating this
testCase.verifyEqual(ind,[1,6,4].', AbsTol = 1e-5); % online indices are
% 4, 1, 7 I'm guessing their method might be different? 6 and 7
% are artificial anyway so 6 or 7 doesn't matter?
testCase.verifyEqual(exitflag,0, AbsTol = 1e-5);
end
end
end