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 |
List-I | List-II | ||
A | If the corner points of the feasible region For an LPP are (0, 4), (5, 0), (7, 9), then the minimum value of the objective function Z =5x+y is. | I | 27 |
B | If the corner points of the feasible region for an LPP are (0, 0), (0, 2), (3, 4), (5, 3). then the maximum value of the objective function Z=3x+4y | II | 60 |
C | The comer points of the feasible region for an LPP are (0, 2), (1, 2), (4,3), (7, 0). The objective function is Z = x+5y. Then (Max Z+Min Z) is | III | 25 |
D | If the corner points of the feasible region for an LPP are (0, 4), (3, 0), (3, 2), (6,9) The objective function is Z=2x+6y. Then (Max Z-Min Z) | IV | 26 |