Question

# For a linear programming equation, convex set of equations is included in region ofA. Feasible solutionsB. Disposed solutionsC. Profit solutionsD. Loss solutions

Verified
128.1k+ views
Hint:For, the linear programming problem to have a unique solution, we take into consideration
One equation, represents a objective function of $x$ and $y$, i.e. $z = ax + by$ and the two inequalities, represents the constraints like $mx + ny \geqslant c$ or $px + qy \leqslant r$.