Let the corner points of the bounded feasible region of an LPP determined by a set of constraints are A(1, 5), B(3, 2) and C(2, 1). If the objective function $z=2ax+by$, $a,b>0$ has maximum values at points A and B, and z has minimum value 8 at point C, then the value of $4a+b$ is:

The point which provides the optimal solution of the linear programming problem

maximize $z = 21x + 35y$

$3x + 2y \leq 30$

$4x + 5y \leq 60$

$x \geq 0, y \geq 0$

has the coordinates

For the LPP

Maximise $z = x + y$

subject to $x - y \leq -1$, $-x + y \leq 2$, $x, y \geq 0$, $z$ has :

Given the following L.P.P., in which objective function represents the maximum profit ($Z$) (in Rs.) such as

Max. $Z=40x+30y$, subject to constraints:

$x+3y \le 12,\ 3x+y \le 12,\ x,y \ge 0$

The value of the maximum profit is:

Consider the following L.P.P

Max. z = 5x + 2y; subject to -2x - 3y ≤ -6, x - 2y ≤ 2, 3x + 2y ≤ 12, -3x + 2y ≤ 3 and x, y ≥ 0 then

For the objective function $Z = 3x + 5y$ subject to constraints $x + 3y \geq 3$, $x + y \geq 2$, $x \geq 0$, $y \geq 0$:

The solution of a LPP with basic feasible solutions (0, 0), (10, 0), (0, 20), (10, 15) and objective function Max $Z = 2x + 3y$ is :