Solution:About duality in Linear Planning:- If a linear programming problem is maximizing type, then its dual is minimizing type. Both primal and dual have the same optimum value. The dual of a linear programming problem is the primal problem.
If the optimal solution to one problem is known, it is easy to fund the optimal solution to another. Duals are easier to solve than primals.
If maximizing linear programming problem is with "less than type constraints, the dual of this problem will have "more than type constraints.