Advertisements
Advertisements
प्रश्न
To maintain one's health, a person must fulfil certain minimum daily requirements for the following three nutrients: calcium, protein and calories. The diet consists of only items I and II whose prices and nutrient contents are shown below:
| Food I | Food II | Minimum daily requirement | |
| Calcium Protein Calories |
10 5 2 |
4 6 6 |
20 20 12 |
| Price | Rs 0.60 per unit | Rs 1.00 per unit |
Find the combination of food items so that the cost may be minimum.
Advertisements
उत्तर
Let the person takes x units and y units of food I and II respectively that were taken in the diet.
Since, per unit of food I costs Rs 0.60 and that of food II costs Rs 1.00.
Therefore, x lbs of food I costs Rs 0.60x and y lbs of food II costs Rs 1.00y.
Total cost per day = Rs (0.60x +1.00y)
Let Z denote the total cost per day
Then, Z = 0.60x +1.00y
Since, each unit of food I contains 10 units of calcium.Therefore, x units of food I contains 10x units of calcium.
Each unit of food II contains 4 units of calcium.So, y units of food II contains 4y units of calcium.
Thus, x units of food I and y units of food II contains (10x + 4y) units of calcium.
But, the minimum requirement is 20 units of calcium.
∴ \[10x + 4y \geq 20\]
Since, each unit of food I contains 5 units of protein.Therefore, x units of food I contains 5x units of protein.
Each unit of food II contains 6 units of protein.So,y units of food II contains 6y units of protein.
Thus, x units of food I and y units of food II contains (5x + 6y) units of protein.
But, the minimum requirement is 20 lbs of protein.
∴ \[5x + 6y \geq 20\]
Since, each unit of food I contains 2 units of calories.Therefore, x units of food I contains 2x units of calories.
Each unit of food II contains 6 units of calories.So,y units of food II contains 6y units of calories.
Thus, x units of food I and y units of food II contains (2x + 6y) units of calories.
But, the minimum requirement is 12 lbs of calories.\[\therefore 2x + 6y \geq 12\]
Finally, the quantities of food I and food II are non negative values.
So,
\[x, y \geq 0\]
Hence, the required LPP is as follows:
Min Z = 0.60x + 1.00y
subject to
\[10x + 4y \geq 20\]
\[5x + 6y \geq 20\]
\[2x + 6y \geq 12\]
\[x, y \geq 0\]
First, we will convert the given inequations into equations, we obtain the following equations:
10x + 4y = 20, 5x +6y = 20, 2x + 6y =12, x = 0 and y = 0
Region represented by 10x + 4y ≥ 20:
The line 10x + 4y = 20 meets the coordinate axes at A(2, 0) and B(0, 5) respectively. By joining these points we obtain the line
10x + 4y = 20.Clearly (0,0) does not satisfies the inequation 10x + 4y ≥ 20. So,the region in xy plane which does not contain the origin represents the solution set of the inequation 10x + 4y ≥ 20.
Region represented by 5x +6y ≥ 20:
The line 5x +6y = 20 meets the coordinate axes at
\[C\left( 4, 0 \right)\] and \[D\left( 0, \frac{10}{3} \right)\] respectively. By joining these points we obtain the line
5x +6y = 20.Clearly (0,0) does not satisfies the 5x +6y ≥ 20. So,the region which does not contains the origin represents the solution set of the inequation 5x +6y ≥ 20.
Region represented by 2x + 6y ≥ 12:
The line 2x + 6y =12 meets the coordinate axes at \[E\left( 6, 0 \right)\] and \[E\left( 6, 0 \right)\] respectively. By joining these points we obtain the line
2x + 6y =12.Clearly (0,0) does not satisfies the inequation 2x + 6y ≥ 12. So,the region which does not contains the origin represents the solution set of the inequation 2x + 6y≥ 12.
Region represented by x ≥ 0 and y ≥ 0:
Since, every point in the first quadrant satisfies these inequations. So, the first quadrant is the region represented by the inequations x ≥ 0, and y ≥ 0.
The feasible region determined by the system of constraints 10x + 4y ≥ 20, 5x +6y ≥ 20, 2x + 6y ≥ 12, x ≥ 0, and y ≥ 0 are as follows.

The set of all feasible solutions of the above LPP is represented by the feasible region shaded in the graph.
The corner points of the feasible region are B(0, 5), G \[\left( 1, \frac{5}{2} \right)\],H \[\left( \frac{8}{3}, \frac{10}{9} \right)\] and E \[\left( 6, 0 \right)\]
The value of the objective function at these points are given by the following table
| Points | Value of Z |
| B |
\[0 . 6\left( 0 \right) + 5 = 5\]
|
| G |
\[0 . 6\left( 1 \right) + \frac{5}{2} = 3 . 1\]
|
| H |
\[0 . 6\left( \frac{8}{3} \right) + \left( \frac{10}{9} \right) = 1 . 6 + 1 . 1 = 2 . 7\]
|
| E |
\[0 . 6\left( 6 \right) + \left( 0 \right) = 3 . 6\]
|
We see that the minimum cost is 2.7 which is at \[\left( \frac{8}{3}, \frac{10}{9} \right)\].Thus, at minimum cost, \[\frac{8}{3}\] units of food I and \[\frac{10}{9}\] units of food II should be included in the diet.
APPEARS IN
संबंधित प्रश्न
Minimize :Z=6x+4y
Subject to : 3x+2y ≥12
x+y ≥5
0 ≤x ≤4
0 ≤ y ≤ 4
Minimum and maximum z = 5x + 2y subject to the following constraints:
x-2y ≤ 2
3x+2y ≤ 12
-3x+2y ≤ 3
x ≥ 0,y ≥ 0
A manufacturer produces two products A and B. Both the products are processed on two different machines. The available capacity of first machine is 12 hours and that of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at Rs 7 profit and B at a profit of Rs 4. Find the production level per day for maximum profit graphically.
A manufacturing company makes two types of teaching aids A and B of Mathematics for class XII. Each type of A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each type of B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available per week are 180 and 30, respectively. The company makes a profit of Rs 80 on each piece of type A and Rs 120 on each piece of type B. How many pieces of type A and type B should be manufactured per week to get maximum profit? Make it as an LPP and solve graphically. What is the maximum profit per week?
Maximize Z = 10x + 6y
Subject to
\[3x + y \leq 12\]
\[2x + 5y \leq 34\]
\[ x, y \geq 0\]
Maximize Z = 3x + 4y
Subject to
\[2x + 2y \leq 80\]
\[2x + 4y \leq 120\]
Minimize Z = 30x + 20y
Subject to
\[x + y \leq 8\]
\[ x + 4y \geq 12\]
\[5x + 8y = 20\]
\[ x, y \geq 0\]
Maximize Z = 4x + 3y
Subject to
\[3x + 4y \leq 24\]
\[8x + 6y \leq 48\]
\[ x \leq 5\]
\[ y \leq 6\]
\[ x, y \geq 0\]
Maximize Z = 3x + 5y
Subject to
\[x + 2y \leq 20\]
\[x + y \leq 15\]
\[ y \leq 5\]
\[ x, y \geq 0\]
Minimize Z = 3x1 + 5x2
Subject to
\[x_1 + 3 x_2 \geq 3\]
\[ x_1 + x_2 \geq 2\]
\[ x_1 , x_2 \geq 0\]
Maximize Z = −x1 + 2x2
Subject to
\[- x_1 + 3 x_2 \leq 10\]
\[ x_1 + x_2 \leq 6\]
\[ x_1 - x_2 \leq 2\]
\[ x_1 , x_2 \geq 0\]
Maximize Z = 3x1 + 4x2, if possible,
Subject to the constraints
\[x_1 - x_2 \leq - 1\]
\[ - x_1 + x_2 \leq 0\]
\[ x_1 , x_2 \geq 0\]
Show the solution zone of the following inequalities on a graph paper:
\[5x + y \geq 10\]
\[ x + y \geq 6\]
\[x + 4y \geq 12\]
\[x \geq 0, y \geq 0\]
Find x and y for which 3x + 2y is minimum subject to these inequalities. Use a graphical method.
A dietician has to develop a special diet using two foods P and Q. Each packet (containing 30 g) of food P contains 12 units of calcium, 4 units of iron, 6 units of cholesterol and 6 units of vitamin A. Each packet of the same quantity of food Q contains 3 units of calcium, 20 units of iron, 4 units of cholesterol and 3 units of vitamin A. The diet requires atleast 240 units of calcium, atleast 460 units of iron and at most 300 units of cholesterol. How many packets of each food should be used to minimise the amount of vitamin A in the diet? What is the minimum of vitamin A.
A factory owner purchases two types of machines, A and B, for his factory. The requirements and limitations for the machines are as follows:
| Area occupied by the machine |
Labour force for each machine |
Daily output in units |
|
| Machine A Machine B |
1000 sq. m 1200 sq. m |
12 men 8 men |
60 40 |
He has an area of 7600 sq. m available and 72 skilled men who can operate the machines.
How many machines of each type should he buy to maximize the daily output?
A manufacturer of Furniture makes two products : chairs and tables. processing of these products is done on two machines A and B. A chair requires 2 hrs on machine A and 6 hrs on machine B. A table requires 4 hrs on machine A and 2 hrs on machine B. There are 16 hrs of time per day available on machine A and 30 hrs on machine B. Profit gained by the manufacturer from a chair and a table is Rs 3 and Rs 5 respectively. Find with the help of graph what should be the daily production of each of the two products so as to maximize his profit.
A company manufactures two types of novelty Souvenirs made of plywood. Souvenirs of type A require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours 20 minutes available for cutting and 4 hours available for assembling. The profit is 50 paise each for type A and 60 paise each for type B souvenirs. How many souvenirs of each type should the company manufacture in order to maximize the profit?
An aeroplane can carry a maximum of 200 passengers. A profit of Rs 400 is made on each first class ticket and a profit of Rs 600 is made on each economy class ticket. The airline reserves at least 20 seats of first class. However, at least 4 times as many passengers prefer to travel by economy class to the first class. Determine how many each type of tickets must be sold in order to maximize the profit for the airline. What is the maximum profit.
A merchant plans to sell two types of personal computers a desktop model and a portable model that will cost Rs 25,000 and Rs 40,000 respectively. He estimates that the total monthly demand of computers will not exceed 250 units. Determine the number of units of each type of computers which the merchant should stock to get maximum profit if he does not want to invest more than Rs 70 lakhs and his profit on the desktop model is Rs 4500 and on the portable model is Rs 5000.
Tow godowns, A and B, have grain storage capacity of 100 quintals and 50 quintals respectively. They supply to 3 ration shops, D, E and F, whose requirements are 60, 50 and 40 quintals respectively. The cost of transportation per quintal from the godowns to the shops are given in the following table:
| Transportation cost per quintal(in Rs.) | ||
| From-> | A | B |
| To | ||
| D | 6.00 | 4.00 |
| E | 3.00 | 2.00 |
| F | 2.50 | 3.00 |
How should the supplies be transported in order that the transportation cost is minimum?
The value of objective function is maximum under linear constraints ______.
A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type A
require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours and 20 minutes available for cutting and 4 hours available for assembling. The profit is Rs. 50 each for type A and Rs. 60 each for type B souvenirs. How many souvenirs of each type should the company manufacture in order to maximize profit? Formulate the above LPP and solve it graphically and also find the maximum profit.
A company manufactures two types of products A and B. Each unit of A requires 3 grams of nickel and 1 gram of chromium, while each unit of B requires 1 gram of nickel and 2 grams of chromium. The firm can produce 9 grams of nickel and 8 grams of chromium. The profit is ₹ 40 on each unit of the product of type A and ₹ 50 on each unit of type B. How many units of each type should the company manufacture so as to earn a maximum profit? Use linear programming to find the solution.
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.
Find the solution set of inequalities 0 ≤ x ≤ 5, 0 ≤ 2y ≤ 7
Maximum value of 4x + 13y subject to constraints x ≥ 0, y ≥ 0, x + y ≤ 5 and 3x + y ≤ 9 is ______.
The maximum value of z = 6x + 8y subject to x - y ≥ 0, x + 3y ≤ 12, x ≥ 0, y ≥ 0 is ______.
The maximum value of Z = 5x + 4y, Subject to y ≤ 2x, x ≤ 2y, x + y ≤ 3, x ≥ 0, y ≥ 0 is ______.
The minimum value of z = 2x + 9y subject to constraints x + y ≥ 1, 2x + 3y ≤ 6, x ≥ 0, y ≥ 0 is ______.
The point which provides the solution to the linear programming problem: Max P = 2x + 3y subject to constraints: x ≥ 0, y ≥ 0, 2x + 2y ≤ 9, 2x + y ≤ 7, x + 2y ≤ 8, is ______
Which of the statements describe the solution set for `-2(x + 8) = - 2x + 20`?
The solution set of the inequality 3x + 5y < 4 is ______.
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 ______.

Solve the following Linear Programming Problem graphically:
Maximize Z = 400x + 300y subject to x + y ≤ 200, x ≤ 40, x ≥ 20, y ≥ 0
The constraints –x1 + x2 ≤ 1, –x1 + 3x2 ≤ 9, x1x2 ≥ 0 define on ______.
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.
