The corner points of the bounded feasible region determined by $x+3y\le60, x+y\ge10, x\le y, x\ge0, y\ge0$ are A(0, 10), B(5, 5), C(15, 15) and D(0, 20). If the objective function $z=ax+by$ has its maximum value on the line segment CD, then the relation between $a$ and $b$ is:

Linear inequalities corresponding to the shaded feasible region OABCO in the given figure are

If the corner points of the bounded feasible region for a Linear Programming Problem (LPP) are A(0,2), B(3, 0), C(2, 3) and D(3, 1), then the maximum value of the objective function $Z = 4x + 2y$ occurs at

The corner points of the feasible region determined by the following system of linear inequalities :

$2x + y \leq 10$, $x + 3y \leq 15$, $x, y \geq 0$ are (0, 0), (5, 0), (3, 4) and (0, 5). Let $z = px + qy$, where $p, q > 0$ condition on p and q so that maximum of z occurs at both (3, 4) and (0, 5) is :

The number of corner points of the feasible region determined by the constraints $2x - y \geq 0, x - 3y + 3 \geq 0, x \geq 0, y \geq 0$ is

For the constriants $x + y \le 60$, $5x + y \le 100$ and $x \ge 0, y \ge 0$, the feasible region is:

Two linear programming problems (LPPs) have same bounded feasible region with three corner points $(0, 3), (4, 4), (7, 0)$. If $Z_1 = x - 3y$ and $Z_2 = 2x + y$ are objective functions of LPPs, then which of the following is/are correct?

A. only $Z_1$ maximizes at $(7, 0)$.

B. both $Z_1, Z_2$ minimize at $(0, 3)$.

C. both $Z_1, Z_2$ maximize at $(7, 0)$.

D. $Z_2$ maximizes at $(4, 4)$.

Choose the correct answer from the options given below: