If the objective function for a LPP is $Z=3x+5y$ and the corner points of the bounded feasible region are (0, 0), (6, 0), (3, 5) and (0, 3), then the value of $|max(Z) - min(Z)|$ is:

The feasible region of inequality $2x + 3y > 6$ is

The optimal solution of the Linear Programming problem

Maximize $Z = 3x_1 + 5x_2$,

s.t. $3x_1 + 2x_2 \leq 18$

$x_1 \leq 4$

$x_2 \leq 6$

$x_1 \geq 0, x_2 \geq 0$ is

Which of the following terms are associated with a linear programming problem?

(A) Constraints

(B) Independent events

(C) Feasible region

(D) Objective function

Choose the correct answer from the options given below:

The corner points of the bounded feasible region for an LPP are: (5, 5), (15, 15), (0, 20) and (0, 10). Let $z = 3x + 9y$ be the objective function. Then the value of $maximum(z) - minimum(z)$ is

A manufacturer produces two products, A and B. Both products are processed on two different machines. The available capacity of the first machine is 12 hours and of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at ₹7 profit and that of product B at a profit of ₹4. A LPP to maximise the profit is:

The vertices of a closed convex polygon representing the feasible region of the LPP with, objective function $z = 5x + 3y$ are $(0, 0)$, $(3, 1)$, $(1, 3)$ and $(0, 2)$. The maximum value of $z$ is