a. Solving the system of linear equations given in the constraints simultaneously, we have that x1=76 and x2=712We can determine the feasible solutions by setting one variable to 0 in each constraint Hence, we have (0,2),(6,0),(0,3),(2,0)(0,2) and (2,0) are feasible solutions, since they satisfy all the constraints and (0,3)and (6,0) are infeasible solutions because they do not satisfy all the constraintsb. Next, we find the optimal solution using simplex methodThe first tableau is given byx3x400x1213−2x2332−3x30100x40010660Applying row reduction techniques to each row and the simplex algorithm, we gettableau 2x2x430x123137−1x23100x3031−321x40010226The final tableau is given byx2x132x12010x23100x3073−7275x40−71737371276748Hence the feasible solution which is optimal is x1=712, x2=76 and z=748
Comments