Test the Simplex2P Algorithm for solving Linear Programming problems.
Test the Simplex2P Algorithm for solving Linear Programming problems.
the constraint matrix
the limit/RHS vector
the cost vector
Test case 1: Phase I solution - not needed Phase II solution x = (9, 9, 4), x_B = (0, 1, 2, 3, 6), f = 22
Test case 1: Phase I solution - not needed Phase II solution x = (9, 9, 4), x_B = (0, 1, 2, 3, 6), f = 22
Test case 2: Phase I solution - not needed Phase II solution x = (12, 28), x_B = (0, 1, 4), f = 800
Test case 2: Phase I solution - not needed Phase II solution x = (12, 28), x_B = (0, 1, 4), f = 800
Test case 3: Phase I solution - not needed Phase II solution x = (1, 0, 1, 0), x_B = (0, 2, 4), f = 1
Test case 3: Phase I solution - not needed Phase II solution x = (1, 0, 1, 0), x_B = (0, 2, 4), f = 1
Cycles if you choose most positive objective function coefficient.
Test case 4: Phase I solution - not needed Phase II solution - no solution
Test case 4: Phase I solution - not needed Phase II solution - no solution
There is no solution since the LP is UNBOUNDED.
Test case 5: Phase I solution x = (4, 0), x_B = (0, 2), f = 0 Phase II solution x = (4, 4), x_B = (0, 1, 5), f = 12
Test case 5: Phase I solution x = (4, 0), x_B = (0, 2), f = 0 Phase II solution x = (4, 4), x_B = (0, 1, 5), f = 12
Use -b_i to indicate a ">=" constraint (e.g., b_1 = -8).
Test case 6: Phase I solution x = (4, 0), x_B = (0, 2), f = 0 Phase II solution x = (0, 5), x_B = (0, 1, 5), f = 40
Test case 6: Phase I solution x = (4, 0), x_B = (0, 2), f = 0 Phase II solution x = (0, 5), x_B = (0, 1, 5), f = 40
Use -b_i to indicate a ">=" constraint (e.g., b_4 = -5).
This object is used to test the Simplex2P class.