Fill in the blanks
$ (i)$ In a $LPP$, the objective function is always
$(ii)$ The feasible region for a $LPP$ is always a polygon.
$(iii)$ A feasible region of a system of linear inequalities is said to be , if it can be enclosed within a circle.
$(iv)$ In a $LPP$, if the objective function $Z = ax + by$
has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same value.