-
Notifications
You must be signed in to change notification settings - Fork 0
/
simplex.rb
293 lines (268 loc) · 5.09 KB
/
simplex.rb
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
require 'minitest/autorun'
require 'compsci/simplex'
include CompSci
class SimplexTest < Minitest::Test
parallelize_me!
def test_2x2
result = Simplex.new(
[1, 1],
[
[ 2, 1],
[ 1, 2],
],
[4, 3]
).solution
assert_equal [Rational(5, 3), Rational(2, 3)], result
end
def test_2x2_b
result = Simplex.new(
[3, 4],
[
[ 1, 1],
[ 2, 1],
],
[4, 5]
).solution
assert_equal [0, 4], result
end
def test_2x2_c
result = Simplex.new(
[2, -1],
[
[ 1, 2],
[ 3, 2],
],
[6, 12]
).solution
assert_equal [4, 0], result
end
def test_3x3_a
result = Simplex.new(
[60, 90, 300],
[
[1, 1, 1],
[1, 3, 0],
[2, 0, 1]
],
[600, 600, 900]
).solution
assert_equal [0, 0, 600], result
end
def test_3x3_b
result = Simplex.new(
[70, 210, 140],
[
[ 1, 1, 1],
[ 5, 4, 4],
[40, 20, 30]
],
[100, 480, 3200]
).solution
assert_equal [0, 100, 0], result
end
def test_3x3_c
result = Simplex.new(
[2, -1, 2],
[
[ 2, 1, 0],
[ 1, 2, -2],
[ 0, 1, 2]
],
[10, 20, 5]
).solution
assert_equal [5, 0, Rational(5, 2)], result
end
def test_3x3_d
result = Simplex.new(
[11, 16, 15],
[
[ 1, 2, Rational(3, 2)],
[Rational(2, 3), Rational(2, 3), 1],
[Rational(1, 2), Rational(1, 3), Rational(1, 2)]
],
[12_000, 4_600, 2_400]
).solution
assert_equal [600, 5_100, 800], result
end
def test_3x3_e
simplex = Simplex.new(
[5, 4, 3],
[
[2, 3, 1],
[4, 1, 2],
[3, 4, 2]
],
[5, 11, 8]
)
assert_equal [2, 0, 1], simplex.solution
end
def test_3x3_f
simplex = Simplex.new(
[3, 2, -4],
[
[1, 4, 0],
[2, 4,-2],
[1, 1,-2]
],
[5, 6, 2]
)
assert_equal [4, 0, 1], simplex.solution
end
def test_3x3_g
simplex = Simplex.new(
[2, -1, 8],
[
[2, -4, 6],
[-1, 3, 4],
[0, 0, 2]
],
[3, 2, 1]
)
assert_equal [Rational(17, 2), Rational(7,2), 0], simplex.solution
end
def test_3x4
result = Simplex.new(
[100_000, 40_000, 18_000],
[
[20, 6, 3],
[ 0, 1, 0],
[-1,-1, 1],
[-9, 1, 1]
],
[182, 10, 0, 0]
).solution
assert_equal [4, 10, 14], result
end
def test_4x4
result = Simplex.new(
[1, 2, 1, 2],
[
[1, 0, 1, 0],
[0, 1, 0, 1],
[1, 1, 0, 0],
[0, 0, 1, 1]
],
[1, 4, 2, 2]
).solution
assert_equal [0, 2, 0, 2], result
end
def test_cycle
result = Simplex.new(
[10, -57, -9, -24],
[
[0.5, -5.5, -2.5, 9],
[0.5, -1.5, -0.5, 1],
[ 1, 0, 0, 0]
],
[0, 0, 1]
).solution
assert_equal [1, 0, 1, 0], result
end
def test_cycle2
simplex = Simplex.new(
[2, 3, -1, -12],
[
[-2, -9, 1, 9],
[Rational(1, 3), 1, Rational(-1, 3), -2],
],
[0, 0]
)
assert_raises Simplex::UnboundedProblem do
simplex.solution
end
end
def test_error_mismatched_dimensions
assert_raises ArgumentError do
Simplex.new(
[10, -57, -9],
[
[0.5, -5.5, -2.5, 9],
[0.5, -1.5, -0.5, 1],
[ 1, 0, 0, 0]
],
[0, 0, 1]
)
end
assert_raises ArgumentError do
Simplex.new(
[10, -57, -9, 2],
[
[0.5, -5.5, 9, 4],
[0.5, -1.5, 1],
[ 1, 0, 0]
],
[0, 0, 1]
)
end
assert_raises ArgumentError do
Simplex.new(
[10, -57, -9, 2],
[
[0.5, -5.5, 9, 4],
[0.5, -1.5, 1, 5],
[ 1, 0, 0, 5]
],
[0, 1]
)
end
end
def test_manual_iteration
simplex = Simplex.new(
[10, -57, -9, -24],
[
[0.5, -5.5, -2.5, 9],
[0.5, -1.5, -0.5, 1],
[ 1, 0, 0, 0]
],
[0, 0, 1]
)
while simplex.can_improve?
assert simplex.formatted_tableau.is_a?(Array)
simplex.pivot
end
result = simplex.solution
assert_equal [1, 0, 1, 0], result
end
def test_cup_factory
result = Simplex.new(
[25, 20],
[
[20, 12],
[1, 1]
],
[1800, 8*15]
)
assert_equal [45, 75], result.solution
end
#def test_infeasible1
# simplex = Simplex.new(
# [2, -1],
# [
# [1, -1],
# [-1, 1]
# ],
# [1, -2]
# )
# while simplex.can_improve?
# puts
# puts simplex.formatted_tableau
# simplex.pivot
# end
# p :done
# puts
# puts simplex.formatted_tableau
#end
def test_unbounded
simplex = Simplex.new(
[1, 1, 1],
[
[3, 1, -2],
[4, 3, 0]
],
[5, 7]
)
assert_raises Simplex::UnboundedProblem do
simplex.solution
end
end
end