If the feasible region of an LPP is bounded and the corresponding objective function is $z = 5x - 9y$, then the objective function attains:

Consider an LPP: Maximise $Z = 50x + 15y$ subjected to constraints

$x + y \leq 60$,

$5x + y \leq 100$,

$x, y \geq 0$.

If the maximum value of $Z$ occurs at $x = \alpha$ and $y = \beta$, then the value of $\alpha + \beta$ is

The corner points of the bounded feasible region for an LPP are (0, 20), (3,12), (6,8), and (0,15). The objective function is $Z = \alpha x + \beta y$, where $\alpha, \beta > 0$. If the maximum of Z occurs at the corner points (3,12) and (6,8), then the relationship between $\alpha$ and $\beta$ is:

If the objective function for a LPP is $Z=3x+4y$ and the corner points for bounded feasible region are (9,0), (4,3), (2,5) and (0,8), then the maximum value of Z occurs at

In a Linear Programming problem, the objective function is always :

For a LPP, the objective function is $z=4x+3y$ and the feasible region determined by a set of linear constraints is shown in the graph as a shaded portion. Which one of the following statement is true ?

The corner points of the bounded feasible region determined by the system of linear constraints are $(0, 0)$, $(5, 0)$, $(6, 5)$, $(6, 8)$, $(4, 10)$, $(0, 8)$. Let $Z = 3x - 4y$ be the objective function. The minimum value of Z occurs at