Determine (and justify) which of the following solution is (i) a feasible solution to the linear programming problem (ii) an extreme point of the feasible region (iii) a basic solution (iv) a basic feasible solution For each basic feasible solution, list the basic variable. a. (0, 3, 0, 5, 6) b. (0, 3, 5, 0, -9) c. (3/2, 0, 0, 1/2, 0) d. (1/2, 1, 1, 0, 2) e. (1, 1, 1/2, 3/2, 1/2)
![Q4. (20 pts) Suppose the canonical form of a linear programming problem is given by the constraint matrix A and<br>the rigth hand side vector b, where<br>[3 0 1 1 0]<br>A = 2 1 0 0 0 and b = 3<br>[5°<br>[4 0 3 0<br>11<br>Determine (and justify) which of the following solution is<br>(i)<br>(ii)<br>(iii)<br>(iv)<br>a feasible solution to the linear programming problem<br>an extreme point of the feasible region<br>a basic solution<br>a basic feasible solution<br>For each basic feasible solution, list the basic variable.<br>(0, 3, 0, 5, 6)<br>b. (0, 3, 5, 0, -9)<br>(3/2, 0, 0, 1/2, 0)<br>d. (1/2, 1, 1, 0, 2)<br>(1, 1, 1/2, 3/2, 1/2)<br>а.<br>с.<br>е.<br>](https://s3.us-east-1.amazonaws.com/storage.unifolks.com/qimg-008/008_9jfixz0-pub1pgtx.jpeg)
Extracted text: Q4. (20 pts) Suppose the canonical form of a linear programming problem is given by the constraint matrix A and the rigth hand side vector b, where [3 0 1 1 0] A = 2 1 0 0 0 and b = 3 [5° [4 0 3 0 11 Determine (and justify) which of the following solution is (i) (ii) (iii) (iv) a feasible solution to the linear programming problem an extreme point of the feasible region a basic solution a basic feasible solution For each basic feasible solution, list the basic variable. (0, 3, 0, 5, 6) b. (0, 3, 5, 0, -9) (3/2, 0, 0, 1/2, 0) d. (1/2, 1, 1, 0, 2) (1, 1, 1/2, 3/2, 1/2) а. с. е.