Suppose the canonical form of a liner programming problem is given by the constraint matrix A and resource vector b, where 3 0 1 1 0 5 A- 2 1 0 0 0 and b= 3. 4 0 3 0 1 6 Determine which of the following points is (i) a feasible solution to the linear programming problem. (ii) an extreme point of the set of feasible solutions. (iii) a basic solution. (iv) a basic feasible solution. For each basic feasible solution x given below, list the basic variables. 0 o : 3 3 0 1 1 (a) 0 (b) 5 (c) 0 (d) 1 (c) 2 5 0 0 % Solution: (0 (a). (c), (e) (ii) (a), (0) (iii) (a), (b), (c) (iv) (a) basic variables are x2, x4, x5 (c) basic variables are x1, x4, and one of x2, x3, x5