Match List I with List II

LIST I	LIST II
A. A solution that does not satisfy all the constraints is called	I. Linear
B. The objective function in an LPP is	II. Convex polygon
C. Linear inequalities or equations on the variables of LPP are called	III. Infeasible solution
D. The feasible region in an LPP, formed by the convex combinations of the corner points, is called	IV. Constraints

Choose the correct answer from the options given below:

Maximum value of Z equals to 40x + 50y subject to constraints $3x + y \leq 9$, $x + 2y \leq 8$, $x, y \geq 0$ occurs at

Given a linear programming problem,

Max $Z = 22x + 18y$, Subject to constraints

$x + y \leq 20, 360x + 240y \leq 5760, x \geq 0, y \geq 0$. Its corner points are :

The corner points of the feasible region determined by $x + y \leq 8$, $2x + y \geq 8$, $x \geq 0$, $y \geq 0$, are A(0, 8), B(4, 0) and C(8, 0). If the objective function Z = ax + by has its maximum value on the line segment AB, then the relation between a and b is :

Which constraints correctly represent the situation 'mixture of x and y must be at least 8 units' ?

For the feasible reason of a LPP as shown, if the equation of OA and BC are $y - 2x = 0$ and $y - 2x = 4$ respectively than constraints for LPP are

If the objective function $Z = px + qy$ ($p, q > 0$) of an LPP has minimum value 7p, at the corner points (2, 3) and (7, 0), then