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 A = 2 1 [4 0 3 0 01 0 0 0 and b = 3 1. Determine (and...

Extracted text: 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 A = 2 1 [4 0 3 0 01 0 0 0 and b = 3 1. 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) а. с. e. in m 6