Corner points of the feasible region for an LPP are : (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let $z = 4x + 6y$ be the objective function. Then, Max z $-$ Min z is equal to :

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

The bounded feasible region of an LPP is shown in the diagram given below.

The objective function $z=3x+10y$ attains optimum values at :

A. Point (0,0)

B. Point (0,4)

C. Point (6,3)

D. Point (5,6)

Choose the correct answer from the options given below:

The maximum value of $Z = 3x + 4y$ subjected to the constraints $3x + 7y \leq 21$, $5x + 2y \leq 10$; $x, y \geq 0$ is :

The objective function $z = 4x + 3y$ can be maximised subject to the constraints $3x + 4y \leq 24$, $8x + 6y \leq 48$, $x \leq 5$, $y \leq 6$, $x \geq 0$, $y \geq 0$ :

The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let $Z = ax + by$, where a, b > 0. Condition on a and b so that the maximizing value of Z occurs at both the points (15, 15) and (0, 20) is:

The corner point of the feasible region determined by a set of linear constraints are : (0,0) , (0,4), (2,5) , (6,3) and (6,0) then which of the following point lie in the feasible region ?