Please select a subject first
Advertisements
Advertisements
Solve the following L.P.P. graphically:
Minimise Z = 5x + 10y
Subject to x + 2y ≤ 120
Constraints x + y ≥ 60
x – 2y ≥ 0 and x, y ≥ 0
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
Solve the following L.P.P. graphically Maximise Z = 4x + y
Subject to following constraints x + y ≤ 50
3x + y ≤ 90,
x ≥ 10
x, y ≥ 0
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
Solve the following L.P.P graphically: Maximise Z = 20x + 10y
Subject to the following constraints x + 2y ≤ 28,
3x + y ≤ 24,
x ≥ 2,
x, y ≥ 0
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
Solve the following LPP graphically :
Maximise Z = 105x + 90y
subject to the constraints
x + y ≤ 50
2x + y ≤ 80
x ≥ 0, y ≥ 0.
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
In order to supplement daily diet, a person wishes to take X and Y tablets. The contents (in milligrams per tablet) of iron, calcium and vitamins in X and Y are given as below :
| Tablets | Iron | Calcium | Vitamin |
| x | 6 | 3 | 2 |
| y | 2 | 3 | 4 |
The person needs to supplement at least 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamins. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each type should the person take in order to satisfy the above requirement at the minimum cost? Make an LPP and solve graphically.
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
Maximise z = 8x + 9y subject to the constraints given below :
2x + 3y ≤ 6
3x − 2y ≤6
y ≤ 1
x, y ≥ 0
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
A company manufactures two types of cardigans: type A and type B. It costs ₹ 360 to make a type A cardigan and ₹ 120 to make a type B cardigan. The company can make at most 300 cardigans and spend at most ₹ 72000 a day. The number of cardigans of type B cannot exceed the number of cardigans of type A by more than 200. The company makes a profit of ₹ 100 for each cardigan of type A and ₹ 50 for every cardigan of type B.
Formulate this problem as a linear programming problem to maximize the profit to the company. Solve it graphically and find the maximum profit.
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is ______.
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
The solution set of the inequality 3x + 5y < 4 is ______.
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
The corner points of the shaded unbounded feasible region of an LPP are (0, 4), (0.6, 1.6) and (3, 0) as shown in the figure. The minimum value of the objective function Z = 4x + 6y occurs at ______.

Concept: Methods to Solve LPP (Graphical / Corner Point Method)
Solve the following Linear Programming Problem graphically:
Maximize Z = 400x + 300y subject to x + y ≤ 200, x ≤ 40, x ≥ 20, y ≥ 0
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
Solve the following linear programming problem graphically:
Minimize: Z = 5x + 10y
Subject to constraints:
x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0.
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
Solve the following linear programming problem graphically:
Maximize: Z = x + 2y
Subject to constraints:
x + 2y ≥ 100,
2x – y ≤ 0
2x + y ≤ 200,
x ≥ 0, y ≥ 0.
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
Solve the following Linear Programming problem graphically:
Maximize: Z = 3x + 3.5y
Subject to constraints:
x + 2y ≥ 240,
3x + 1.5y ≥ 270,
1.5x + 2y ≤ 310,
x ≥ 0, y ≥ 0.
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
Solve the following Linear Programming Problem graphically:
Minimize: Z = 60x + 80y
Subject to constraints:
3x + 4y ≥ 8
5x + 2y ≥ 11
x, y ≥ 0
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
The feasible region corresponding to the linear constraints of a Linear Programming Problem is given below.

Which of the following is not a constraint to the given Linear Programming Problem?
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
Solve the following Linear Programming Problem graphically:
Minimize: z = x + 2y,
Subject to the constraints: x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200, x, y ≥ 0.
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
Solve the following Linear Programming Problem graphically:
Maximize: z = – x + 2y,
Subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.
Concept: Methods to Solve LPP (Graphical / Corner Point Method)
A speaks truth in 60% of the cases, while B in 90% of the cases. In what percent of cases are they likely to contradict each other in stating the same fact? In the cases of contradiction do you think, the statement of B will carry more weight as he speaks truth in more number of cases than A?
Concept: Independent Events
Assume that the chances of a patient having a heart attack is 40%. Assuming that a meditation and yoga course reduces the risk of heart attack by 30% and prescription of certain drug reduces its chance by 25%. At a time a patient can choose any one of the two options with equal probabilities. It is given that after going through one of the two options, the patient selected at random suffers a heart attack. Find the probability that the patient followed a course of meditation and yoga. Interpret the result and state which of the above stated methods is more beneficial for the patient.
Concept: Conditional Probability
