LIST I | LIST II | ||
A. | The common region determined by all the linear constraints of a L.P.P. is called corner point | I. | corner point |
B. | A point in the feasible region which is the intersection of two boundary lines is called, | II. | non-negative |
C. | The feasible region for an LPP is always a | III. | feasible region |
D. | The constraints \(x, y≥0\) describes that the variables involved in a LPP are | IV. | convex polygon |
Assertion (A): The corner points of the bounded feasible region of a L.P.P. are shown below. The maximum value of \( Z = x + 2y \) occurs at infinite points.
Reason (R): The optimal solution of a LPP having bounded feasible region must occur at corner points.