CUET Mathematics: AlgebraLinear Programming. Free, no login required.

The feasible region for an LPP is shown by shaded region in the figure. Then the minimum value of Z = 11x + 7y is

The feasible region represented by the constraints: $x + 2y \geq 100$, $2x - y \leq 0$, $2x + y \leq 200$, $x \geq 0$, $y \geq 0$ of an LPP is:

The corner points of the bounded feasible region determined by the system of linear constraints are (15,0), (40,0), (4,18) and (6, 12). If objective function is Z = 30x + 20y, then the sum of the maximum and the minimum values of Z is

The corner points of the bounded feasible region determined by a set of constraints in an LPP are $P(0, 5)$, $Q(3, 5)$, $R(5, 0)$ and $S(4, 1)$. If the objective function is $z = ax + 2by$, where, $a, b > 0$, then the condition on $a$ and $b$ such that the maximum value of $z$ occurs at $Q$ and $S$ is

For the LPP: minimize $z = 6x + 3y$ subject to the constraints

$4x + y \geq 80$

$x + 5y \geq 115$

$3x + 2y \leq 150$

$x \geq 0, y \geq 0$ then the minimum value of z is

Match List-I with List-II

Choose the correct answer from the options given below:

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

If the objective function z = 4x + 3y has maximum value on a line joining points (3, a) and (b, 2) where a > 0, b > 0 such that a - b = 2, then the maximum value of z is:

With respect to the following shaded feasible region (ABCDEFA), the maximum value of the objective function z = 3x + 4y – 2 is at point(s):

The corner points of a bounded feasible region determined by the following system of linear inequalities $x + 3y \leq 60, x + y \geq 10$, $x \leq y$, $x \geq 0$, $y \geq 0$ are (0,10), (5,5), (15, 15) and (0, 20). Let $z = 2px + qy$, $p, q > 0$. If maximum of z occurs at both (15, 15) and (0, 20), then the relation between p and q is

The corner points of the bounded feasible region of the LPP: Maximize $z = x + y$ subject to constraints $2x + 5y \leq 100$, $8x + 5y \leq 200$, $x \geq 0$, $y \geq 0$ are

If the corner points of bounded feasible region for an LPP are (0,2) (3,0) (6,0) (6,8) and (0, 5) then the minimum value of the objective function f=4x+6y occur at

For the objective function Z=-4x + 6y subject to the constraints 3x + 2y ≥ 5, 7x + 2y ≤ 9, x ≥ 0, y ≥ 0, the maximum value of Z occurs at $(a, b)$ and the minimum value of Z occurs at $(p, q)$ then the value of $\frac{a}{p} + \frac{b}{q}$ is:

For LPP: Maximize $z = 2x + 3y$ subject to the constraints

$x + y \geq 2$, $x + 2y \geq 3$, $x \geq 0$, $y \geq 0$,

which of the following graph represents the feasible region of the above LPP as shaded portion?

Consider the LPP: Maximize $z = 5x + 3y$ subject to $3x + 5y \leq 15$, $5x + 2y \leq 10$, $x,y \geq 0$. The optimal feasible solution occurs at

If the minimum value of the objective function $Z = ax + by$ of an LPP occurs at two points $(3, 5)$ and $(5, 3)$, then

From the below-mentioned graph of shaded feasible region of a linear programming problem (LPP) with objective function

$z = 1.50x + 1.00y$; the maximum value of $z$ will be:

The maximum value of the objective function $z = 10x + 15y$ of an L.P.P. subjected to the constraints

$2x + 4y \leq 8$,

$3x + y \leq 6$,

$-x - y \geq -4$,

$x \geq 0$, $y \geq 0$ is:

The minimum value of $Z = 2x + y$ subjected to $x + y \geq 10, 2x + 3y \leq 26, x, y \geq 0$ is

The corner points of the bounded feasible region determined by the system of linear inequalities are $(0,0)$, $(4,0)$, $(2,4)$ and $(0,5)$. If maximum value of $z = ax + by$, where $a,b > 0$, occurs at both $(2,4)$ and $(4,0)$ then

The corner points of the feasible region determined by a system of linear constraints are $(0, 0)$, $(0, 40)$, $(20, 40)$, $(60, 20)$, $(60, 0)$. If the objective function is $z = 4x + 3y$, then which one of the following is true?

Consider the LPP: Max $Z = 5x + 3y$ subject to $3x + 5y \leq 15, 5x + 2y \leq 10, x \geq 0, y \geq 0$

Match List-I with List-II

Choose the correct answer from the options given below:

The minimum value of $z = 3x + 2y$ subjected to the constraints $2x + y \geq 7, x + 2y \geq 8, x, y \geq 0$ is

Which one of the following represents the correct feasible region determined by the following constraints

$x - y \geq 5$, $5x - 5y \leq 16$

The maximum value of $z = 5x + 7y$ subjected to constraints $x + y \leq 5$, $x \geq 0$, $y \geq 0$ is:

Which of the region shown in the given figures represents the feasible region bounded by the following constraints?

$4x + y \geq 80$, $2x + y \geq 60$, $x + y \leq 80$, $x \geq 0$, $y \geq 0$

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

For the linear programming problem (LPP):

Maximize $Z = x + 1.5y$, subject to constraints,

$x + 2y \leq 40$, $2x + y \leq 40$, $x + y \leq 25$, $x \geq 0$, $y \geq 0$.

Which of the following is NOT correct?

About linear programming problem (LPP), which of the following statements are correct?

(A) In a LPP, the linear inequalities or restrictions on the variables are called linear constraints.

(B) If the feasible region for an LPP is unbounded, then the maximum or minimum value of the objective function $Z = ax + by$ never exists.

(C) The feasible region for an LPP is always convex.

(D) The common region determined by all the linear constraints of an LPP is called the feasible region.

Choose the correct answer from the options given below:

If the objective function $z = px + qy$ has its maximum value at the points (2, 1) and (0, 6), then the relationship between p and q is: