English

A Dietician Mixes Together Two Kinds of Food in Such a Way that the Mixture Contains at Least 6 Units of Vitamin A, 7 Units of Vitamin B, 11 Units of Vitamin C and 9 Units of Vitamin D.

Advertisements
Advertisements

Question

A dietician mixes together two kinds of food in such a way that the mixture contains at least 6 units of vitamin A, 7 units of vitamin B, 11 units of vitamin and 9 units of vitamin D. The vitamin contents of 1 kg of food X and 1 kg of food Y are given below:

  Vitamin
A
Vitamin
B

Vitamin
C

Vitamin
D
Food X
Food Y
1
2
1
1
1
3
2
1

One kg food X costs Rs 5, whereas one kg of food Y costs Rs 8. Find the least cost of the mixture which will produce the desired diet.

Sum
Advertisements

Solution

Let the dietician wishes to mix kg of food X and y kg of food Y.
Therefore,

\[x, y \geq 0\]

As we are given,

  Vitamin A Vitamin B

Vitamin C

Vitamin D
Food X
Food Y
1
2
1
1
1
3
2
1

It is given that the mixture should contain at least 6 units of vitamin A, 7 units of vitamin B, 11 units of vitamin C and 9 units of vitamin D.
Therefore, the constraints are

\[x + 2y \geq 6\]
\[x + y \geq 7\]
\[x + 3y \geq 11\]
\[2x + y \geq 9\]

It is given that cost of food X is Rs 5 per kg and cost of food Y is Rs 8 per kg.
Thus, Z =  \[5x + 8y\]

Thus, the mathematical formulat​ion of the given linear programmimg problem is 
Minimize Z = \[5x + 8y\]

subject to

\[x + 2y \geq 6\]
\[x + y \geq 7\]
\[x + 3y \geq 11\]
\[2x + y \geq 9\]

First, we will convert the given inequations into equations, we obtain the following equations:
x + 2y = 6, x + y = 7x + 3y =11, 2x + y =9, x = 0 and y = 0.
The line x + 2y = 6 meets the coordinate axis at A1(6, 0) and B1(0, 3). Join these points to obtain the line x + 2y = 6. Clearly, (0, 0) does not satisfies the inequation x + 2y ≥ 6. So, the region in xy-plane that does not contains the origin represents the solution set of the given equation.
The line x + y = 7 meets the coordinate axis at C1(7, 0) and D1(0, 7). Join these points to obtain the line x + y = 7. Clearly, (0, 0) does not satisfies the inequation x + y ≥ 7. So, the region in xy-plane that does not contains the origin represents the solution set of the given equation.
The line x + 3y = 11 meets the coordinate axis at \[E_1 \left( 11, 0 \right)\] and  \[F_1 \left( 0, \frac{11}{3} \right)\] Join these points to obtain the line x + 3y = 11.Clearly, (0, 0) does not satisfies the inequation x + 3y ≥ 11. So, the region in xy-plane that does not contains the origin represents the solution set of the given equation.
The line 2x + y = 9 meets the coordinate axis at

\[G_1 \left( \frac{9}{2}, 0 \right)\] and  \[H_1 \left( 0, 9 \right)\] Join these points to obtain the line 2x + y = 9.Clearly, (0, 0) does not satisfies the inequation 2x + y ≥ 9. So, the region in xy-plane that does not contains the origin represents the solution set of the given equation.
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.
These lines are drawn using a suitable scale.
The feasible region determined by the system of constraints is 

 

The corner points are H1(0, 9), I1(2 ,5), J1(5, 2), E1(11, 0).
The values of Z at these corner points are as follows

Corner point Z= 5x + 8y
H1 72
I1 50
J1 41
E1 55

The minimum value of Z is at J1(5, 2) which is Rs 41.
Hence, cheapest combination of foods will be 5 units of food X and 2 units of food Y.

shaalaa.com
  Is there an error in this question or solution?
Chapter 29: Linear programming - Exercise 30.3 [Page 39]

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 29 Linear programming
Exercise 30.3 | Q 5 | Page 39

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

A cooperative society of farmers has 50 hectares of land to grow two crops A and B. The profits from crops A and B per hectare are estimated as Rs 10,500 and Rs 9,000 respectively. To control weeds, a liquid herbicide has to be used for crops A and B at the rate of 20 litres and 10 litres per hectare, respectively. Further not more than 800 litres of herbicide should be used in order to protect fish and wildlife using a pond which collects drainage from this land. Keeping in mind that the protection of fish and other wildlife is more important than earning profit, how much land should be allocated to each crop so as to maximize the total profit? Form an LPP from the above and solve it graphically. Do you agree with the message that the protection of wildlife is utmost necessary to preserve the balance in environment?


Minimum and maximum z = 5x + 2y subject to the following constraints:

x-2y ≤ 2

3x+2y ≤ 12

-3x+2y ≤ 3

x ≥ 0,y ≥ 0


Find graphically, the maximum value of z = 2x + 5y, subject to constraints given below :

2x + 4y  83

x + y  6

x + y  4

x  0, y 0


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


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


Solve the following LPP by graphical method:

Minimize Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 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\]


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\]


Solved the following linear programming problem graphically:
Maximize Z = 60x + 15y
Subject to constraints

\[x + y \leq 50\]
\[3x + y \leq 90\]
\[ x, y \geq 0\]


A hospital dietician wishes to find the cheapest combination of two foods, A and B, that contains at least 0.5 milligram of thiamin and at least 600 calories. Each unit of Acontains 0.12 milligram of thiamin and 100 calories, while each unit of B contains 0.10 milligram of thiamin and 150 calories. If each food costs 10 paise per unit, how many units of each should be combined at a minimum cost?


One kind of cake requires 300 gm of flour and 15 gm of fat, another kind of cake requires 150 gm of flour and 30 gm of fat. Find the maximum number of cakes which can be made from 7.5 kg of flour and 600 gm of fat, assuming that there is no shortage of the other ingradients used in making the cake. Make it as an LPP and solve it graphically.


One kind of cake requires 200 g of flour and 25 g of fat, and another kind of cake requires 100 g of flour and 50 g of fat. Find the maximum number of cakes which can be made from 5 kg of flour and 1 kg of fat assuming that there is no storage of the other ingredients used in making the cakes.


A small manufacturer has employed 5 skilled men and 10 semi-skilled men and makes an article in two qualities deluxe model and an ordinary model. The making of a deluxe model requires 2 hrs. work by a skilled man and 2 hrs. work by a semi-skilled man. The ordinary model requires 1 hr by a skilled man and 3 hrs. by a semi-skilled man. By union rules no man may work more than 8 hrs per day. The manufacturers clear profit on deluxe model is Rs 15 and on an ordinary model is Rs 10. How many of each type should be made in order to maximize his total daily profit.


A company produces two types of goods, A and B, that require gold and silver. Each unit of type A requires 3 gm of silver and 1 gm of gold while that of type B requires 1 gm of silver and 2 gm of gold. The company can produce 9 gm of silver and 8 gm of gold. If each unit of type A brings a profit of Rs 40 and that of type B Rs 50, find the number of units of each type that the company should produce to maximize the profit. What is the maximum profit?


A firm manufactures two products A and B. Each product is processed on two machines M1 and M2. Product A requires 4 minutes of processing time on M1 and 8 min. on M2 ; product B requires 4 minutes on M1 and 4 min. on M2. The machine M1 is available for not more than 8 hrs 20 min. while machine M2 is available for 10 hrs. during any working day. The products A and B are sold at a profit of Rs 3 and Rs 4 respectively.
Formulate the problem as a linear programming problem and find how many products of each type should be produced by the firm each day in order to get maximum profit.


A chemical company produces two compounds, A and B. The following table gives the units of ingredients, C and D per kg of compounds A and B as well as minimum requirements of C and D and costs per kg of A and B. Find the quantities of A and B which would give a supply of C and D at a minimum cost.

  Compound Minimum requirement
A B  
Ingredient C
Ingredient D
1
3
2
1
80
75
Cost (in Rs) per kg 4 6 -

A gardener has supply of fertilizer of type I which consists of 10% nitrogen and 6% phosphoric acid and type II fertilizer which consists of 5% nitrogen and 10% phosphoric acid. After testing the soil conditions, he finds that he needs at least 14 kg of nitrogen and 14 kg of phosphoric acid for his crop. If the type I fertilizer costs 60 paise per kg and type II fertilizer costs 40 paise per kg, determine how many kilograms of each fertilizer should be used so that nutrient requirements are met at a minimum cost. What is the minimum cost?


A company manufactures two articles A and B. There are two departments through which these articles are processed: (i) assembly and (ii) finishing departments. The maximum capacity of the first department is 60 hours a week and that of other department is 48 hours per week. The product of each unit of article A requires 4 hours in assembly and 2 hours in finishing and that of each unit of B requires 2 hours in assembly and 4 hours in finishing. If the profit is Rs 6 for each unit of A and Rs 8 for each unit of B, find the number of units of A and B to be produced per week in order to have maximum profit.


A box manufacturer makes large and small boxes from a large piece of cardboard. The large boxes require 4 sq. metre per box while the small boxes require 3 sq. metre per box. The manufacturer is required to make at least three large boxes and at least twice as many small boxes as large boxes. If 60 sq. metre of cardboard is in stock, and if the profits on the large and small boxes are Rs 3 and Rs 2 per box, how many of each should be made in order to maximize the total profit?


An oil company has two depots, A and B, with capacities of 7000 litres and 4000 litres respectively. The company is to supply oil to three petrol pumps, DEF whose requirements are 4500, 3000 and 3500 litres respectively. The distance (in km) between the depots and petrol pumps is given in the following table:
Figure
Assuming that the transportation cost per km is Rs 1.00 per litre, how should the delivery be scheduled in order that the transportation cost is minimum?


A manufacturer has three machine I, II, III installed in his factory. Machines I and II are capable of being operated for at most 12 hours whereas machine III must be operated for atleast 5 hours a day. She produces only two items M and N each requiring the use of all the three machines.
The number of hours required for producing 1 unit each of M and N on the three machines are given in the following table:
 

Items Number of hours required on machines
  I II III
M 1 2 1
N 2 1 1.25


She makes a profit of ₹600 and ₹400 on items M and N respectively. How many of each item should she produce so as to maximise her profit assuming that she can sell all the items that she produced? What will be the maximum profit?


A manufacturer considers that men and women workers are equally efficient and so he pays them at the same rate. He has 30 and 17 units of workers (male and female) and capital respectively, which he uses to produce two types of goods A and B. To produce one unit of A, 2 workers and 3 units of capital are required while 3 workers and 1 unit of capital is required to produce one unit of B. If A and B are priced at ₹100 and ₹120 per unit respectively, how should he use his resources to maximise the total revenue? Form the above as an LPP and solve graphically. Do you agree with this view of the manufacturer that men and women workers are equally efficient and so should be paid at the same rate?


A small firm manufactures necklaces and bracelets. The total number of necklaces and bracelets that it can handle per day is at most 24. It takes one hour to make a bracelet and half an hour to make a necklace. The maximum number of hours available per day is 16. If the profit on a necklace is Rs 100 and that on a bracelet is Rs 300. Formulate on L.P.P. for finding how many of each should be produced daily to maximize the profit?
It is being given that at least one of each must be produced.


The point at which the maximum value of x + y subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x ≥ 0, y ≥ 0 is obtained, is ______.


 Maximize: z = 3x + 5y  Subject to

x +4y ≤ 24                3x + y  ≤ 21 

x + y ≤ 9                     x ≥ 0 , y ≥0


Find the feasible solution of linear inequation 2x + 3y ≤ 12, 2x + y ≤ 8, x ≥ 0, y ≥ 0 by graphically


The region XOY - plane which is represented by the inequalities -5 ≤ x ≤ 5, -5 ≤ y ≤ 5 is ______ 


The minimum value of z = 7x + 9y subject to 3x + y ≤ 6, 5x + 8y ≤ 40, x ≥ 0, y ≥ 2 is ______.


Which of the statements describe the solution set for `-2(x + 8) = - 2x + 20`?


The constraints –x1 + x2 ≤ 1, –x1 + 3x2 ≤ 9, x1x2 ≥ 0 define on ______.


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.


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.


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.


Solve the following Linear Programming Problem graphically.

Maximise Z = 5x + 2y subject to:

x – 2y ≤ 2,

3x + 2y ≤ 12,

– 3x + 2y ≤ 3,

x ≥ 0, y ≥ 0


If x – y ≥ 8, x ≥ 3, y ≥ 3, x ≥ 0, y ≥ 0 then find the coordinates of the corner points of the feasible region.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×