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

If $5x + y \leq 100$, $x + y \leq 60$, $x \geq 0$, $y \geq 0$. Then one of the corner points of the feasible region is :

In a LPP, let R be the feasible region.

A. If R is unbounded then a max./min. value of objective function may not exist.

B. If R is bounded then a max. and min. value of objective function will always exist.

C. If a solution exists, it must occur at a corner point.

D. If R is bounded then max. will exist but min. may or may not exist for an objective function.

Choose the correct answer from the options given below:

A manufacturing company makes two models M$_1$ and M$_2$ of a product. Each piece of M$_1$ requires 9 labour hours for fabricating and one labour hour for finishing. Each piece of M$_2$ require 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of Rs.800 on each piece of M$_1$ and Rs.1200 on each piece of M$_2$

The above Linear Programming Problem [LPP] is given by

A manufacturing company makes two models M$_1$ and M$_2$ of a product. Each piece of M$_1$ requires 9 labour hours for fabricating and one labour hour for finishing. Each piece of M$_2$ require 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of Rs.800 on each piece of M$_1$ and Rs.1200 on each piece of M$_2$

The maximum profit will be at the point

The feasible region for an LPP is shown below. Let $Z = 3x - 4y$ be the objective function. Maximum of Z occurs at :

The region represented by the system of inequalities $x, y \geq 0$ ; $2x + 3y \geq 4$ ; $x \geq 1$ is :

Owner of a whole sale computers shop plans to sell 2 types of computers. A desktop and portable model. If $x$ is the number of desktops and $y$ is the number of portable model and the shop's capacity cannot exceed 250 units. Which of the following is correct ?

The feasible region for a LPP is shown in the given figure. The maximum value of $z = 2x + 5y$ is :

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

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

Compare the quantity in Column - A and Column - B.

The corner points of the feasible region determined by the following system of linear inequalities :

$2x + y \leq 10$, $x + 3y \leq 15$, $x, y \geq 0$ are (0, 0), (5, 0), (3, 4) and (0, 5). Let $z = px + qy$, where $p, q > 0$ condition on p and q so that maximum of z occurs at both (3, 4) and (0, 5) is :

For the LPP

Maximise $z = x + y$

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

Choose the wrong statement from the following :

Match List - I with List - II.

Choose the correct answer from the options given below :

If corner points of a feasible region are (0, 0), (2, 0), $\left(\frac{20}{19}, \frac{45}{19}\right)$ and (0, 3), then

(A) Maximum value of $z = 5x + 3y$ is 10

(B) Minimum value of $z = 5x + 3y$ is 0

(C) Maximum value of $z = 5x + 3y$ is $\frac{235}{19}$ and minimum value is 0

(D) Maximum value of $z = 5x + 3y$ is 10 and minimum value is 0

Choose the correct answer from the options given below :

The solution of LPP

max.(z) = $5x + 3y$ subject to

$2x + y \leq 6$

$x + y \leq 4$

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

The corner points of the feasible region determined by inequalities of LPP are $(4, 10)$, $(6, 8)$ and $(6, 5)$. Let $z = 3x + 4y$ be the objective function. Then the sum of maximum value of z and minimum value of z is :

Consider the linear programming problem :

Minimize $z = 50x + 70y$

Subject to $2x+y \geq 8$, $x+2y \geq 10$, $x \geq 0$, $y \geq 0$

The minimum value of objective function 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

The optimal value of linear programming problem maximum $Z = 3x + 4y$, subject to,

$x + 3y \leq 12$

$x + y \geq 8$

$x, y \geq 0$ is

The objective function for a L.P.P. is $Z = 5x + 7y$ and the corner points of the bounded feasible region are (0, 0), (7, 0), (3, 4) and (0, 2), then the maximum value of Z occurs at

The maximum value of $z = 4x + 3y$, if the feasible region for an LPP is as shown below is:

A manufacturer of electronic circuit has a stock of 200 resistors, 120 transistors and 150 capacitors and is required to produce two types of circuits A and B. Type A requires 20 resistors, 10 transistors and 10 capacitors. Type B requires 10 resistors, 20 transistors and 30 capacitors. If the profit on type A circuit is Rs. 50 and that on type B circuit is Rs. 60, identify the constraints for this LPP, if it was assumed that x circuit B of type A and y circuits of type B was produced by the manufacturer.

A. $x + 2y \geq 15$

B. $2x + y \leq 20$

C. $x + 2y \leq 12$

D. $x, y \leq 0$

Choose the correct answer from the options given below

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

In linear programming, the optimal value of the objective function is attained at the points given by