2.

(a) What is the difference between a feasible solution, a basic feasible solution, and an optimal solution of a linear programming problem?

(b) What is the difference between simplex solution procedure for a 'maximisation' and a

'minimisation' problem?

(c) Using the concept of net contribution, provide an intuitive explanation of why the criterion for optimality for maximisation problems is different from that of minimisation problems.