1. Check that the given simplex tableau is in final form. Find the solution to the associated regular
linear programming problem.
2. Find the maximum value of p = 2x + 3y subject to
2x + y ≤ 15
x + 3y ≤ 20
x ≥ 0, y ≥ 0
A) P= 5, x = 25 and y = 5
B) P= 5, x = 25 and y = 25
C) P= 25, x = 5 and y = 5
D) P= 5, x = 5 and y = 5
3. Check that the given simplex tableau is in final form. Find the solution to the associated regular linear
programming problem.
4. Check that the given simplex tableau is not in final form. Find the pivot element to be used in the next
iteration of the simplex method.
A) pivot element is 5, lying in the third row, third column.
B) pivot element is 0, lying in the first row, third column.
C) pivot element is 5, lying in the third row, second column.
D) pivot element is 2, lying in the first row, second column.
5. Find the pivot element to be used in the next iteration of the simplex method.
6. Find the pivot element to be used in the next iteration of the simplex method.
7. Determine whether the given simplex table is in the final form. If so, find the solution to the
associated regular linear programming problem.
8. Solve the linear programming problem by the simplex method.
A) x = 0, y = 4, u = 0, v = 1, P = 28
B) x = 1, y = 0, u = 0, v = 0, P = 27
C) x = 1, y = 3, u = 0, v = 0, P = 27
D) x = 2.5, y = 0, u = 1.5, v = 0, P = 15
9. Solve the linear programming problem by the simplex method.
10. Solve the linear programming problem by the simplex method.
A) x = 0, y = 8, u = 16, v = 10, w = 0, P = 16
B) x = 8, y = 8, u = 0, v = 10, w = 0, P = 24
C) x = 8, y = 0, u = 0, v = 2, w = 16, P = 24
D) x = 6, y = 6, u = 0, v = 0, w = 0, P = 30
11. Solve the linear programming problem by the simplex method.
12. Solve the linear programming problem by the simplex method.
A) x = 0, y = 0, z = 2, u = 4, v = 0, P = 75
B) x = 0, y = 2, z = 4, u = 0, v = 0, P = 44
C) x = 0, y = 0, z = 0, u = 2, v = 4, P = 79
D) x = 2, y = 4, z = 0, u = 0, v = 0, P = 28
13. Solve the linear programming problem by the simplex method.
A) x = 13, y = 1, z = 0, u = 18, v = 0, w = 0, P = 67
B) x = 1, y = 0, z = 13, u = 18, v = 0, w = 0, P = 116
C) x = 0, y = 13, z = 0, u = 18, v = 0, w = 0, P = 47
D) x = 0, y = 0, z = 1, u = 18, v = 0, w = 0, P = 48
14. Solve the linear programming problem by the simplex method.
A) x = 16, y = 0, z = 16, t = 0, u = 80, v = 21, w = 61, P = 180
B) x = 0, y = 16, z = 0, t = 0, u = 80, v = 21, w = 61, P = 96
C) x = 80, y = 16, z = 0, t = 0, u = 0, v = 21, w = 61, P = 68
D) x = 80, y = 0, z = 0, t = 16, u = 80, v = 21, w = 61, P = 174
15. Solve the linear programming problem by the simplex method.
A) x = 1, y = 1, z = 1, u = 0, v = 0, w = 0, P = 74
B) x = 1, y = 0, z = 1, u = 1, v = 0, w = 0, P = 80
C) x = 1, y = 1, z = 1, u = 0, v = 0, w = 0, P = 136
D) x = 0, y = 1, z = 0, u = 1, v = 1, w = 0, P = 56
16. Maximize
P= 10x + 12y
subject to
17. Maximize
P = 3x + 5y + 2z
subject to
18. Consider the linear programming problem.
Sketch the feasible set for the linear programming problem.
19. Find the minimum value of c = 4x + 5y subject to
x + 2y ≥ 10
2x + 3y ≥ 18
x ≥ 0, y ≥ 0
A) P= 30, x = 0 and y = 0
B) P= 30, x = 6 and y = 6
C) P= 30, x = 0 and y = 6
D) P= 30, x = 30 and y = 6
20. Consider the linear programming problem.
Sketch the feasible set for the linear programming problem.
Purchase answer to see full
attachment