English

To Maintain His Health Person Must Fulfil Certain Minimum Daily Requirements for Several Kinds of Nutrients .What Combination of Two Food Items Will Satisfy Daily Requirement and Entail Least Cost?

Advertisements
Advertisements

Question

To maintain his health a person must fulfil certain minimum daily requirements for several kinds of nutrients. Assuming that there are only three kinds of nutrients-calcium, protein and calories and the person's diet consists of only two food items, I and II, whose price and nutrient contents are shown in the table below:
 

  Food I
(per lb)
  Food II
(per lb)
    Minimum daily requirement
for the nutrient
 Calcium 10   5     20
Protein 5   4     20
 Calories 2   6     13
 Price (Rs) 60   100      


What combination of two food items will satisfy the daily requirement and entail the least cost? Formulate this as a LPP.

Sum
Advertisements

Solution

Let the person takes x lbs and y lbs of food I and II respectively that were taken in the diet.
Since, per lb of food I  costs Rs 60 and that of food II costs Rs 100.
Therefore, x lbs of food I  costs Rs 60x and y lbs of food II costs Rs 100y.
Total cost per day = Rs (60x + 100y)
​Let Z denote the total cost per day
Then, Z = 60x + 100y
Total amount of calcium in the diet is  \[10x + 5y\]

Since, each lb of food I contains 10 units of calcium.Therefore, x lbs of food I contains 10x units of calcium.
Each lb of food II contains 5 units of calciu.So,y lbs of food II contains 5y units of calcium.
Thus, x lbs of food I and y lbs of food II contains 10x + 5y units of calcium.
But, the minimum requirement is 20 lbs of calcium.

\[\therefore\] \[10x + 5y \geq 20\]
Since, each lb of food I contains 5 units of protein.Therefore, x lbs of food I contains 5x units of protein.
Each lb of food II contains 4 units of protein.So,y lbs of food II contains 4y units of protein.
Thus, x lbs of food I and y lbs of food II contains 5x + 4y units of protein.
But, the minimum requirement is 20 lbs of protein.
\[\therefore\] \[5x + 4y \geq 20\]
Since, each lb of food I contains 2 units of calories.Therefore, x lbs of food I contains 2units of calories.
Each lb of food II contains  units of calories.So,y lbs of food II contains 6y units of calories.
Thus, x lbs of food I and y lbs of food II contains
2x + 6y units of calories.
But, the minimum requirement is 13 lbs of calories.
\[\therefore 2x + 6y \geq 13\]
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 = 60x + 100y
subject to  
\[10x + 5y \geq 20\]
\[5x + 4y \geq 20\]
\[2x + 6y \geq 13\]
\[x, y \geq 0\]
shaalaa.com
  Is there an error in this question or solution?
Chapter 29: Linear programming - Exercise 30.1 [Page 15]

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 29 Linear programming
Exercise 30.1 | Q 7 | Page 15

RELATED QUESTIONS

Solve the following Linear Programming Problems graphically:

Maximise Z = 3x + 4y

subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.


Solve the following Linear Programming Problems graphically:

Minimise Z = x + 2y

subject to 2x + y ≥ 3, x + 2y ≥ 6, x, y ≥ 0.


Maximise Z = 3x + 4y, subject to the constraints: x + y ≤ 1, x ≥ 0, y ≥ 0


Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 2, x ≥ 0, y ≥ 0.


Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown in Figure


Refer to Exercise 7 above. Find the maximum value of Z.


A man rides his motorcycle at the speed of 50 km/hour. He has to spend Rs 2 per km on petrol. If he rides it at a faster speed of 80 km/hour, the petrol cost increases to Rs 3 per km. He has atmost Rs 120 to spend on petrol and one hour’s time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem


Refer to question 15. Determine the maximum distance that the man can travel.


Maximise Z = x + y subject to x + 4y ≤ 8, 2x + 3y ≤ 12, 3x + y ≤ 9, x ≥ 0, y ≥ 0.


In order to supplement daily diet, a person wishes to take some X and some wishes Y tablets. The contents of iron, calcium and vitamins in X and Y (in milligrams per tablet) are given as below:

Tablets Iron Calcium Vitamin
X 6 3 2
Y 2 3 4

The person needs atleast 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamin. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each should the person take in order to satisfy the above requirement at the minimum cost?


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

Column A Column B
Maximum of Z 325

The feasible solution for a LPP is shown in Figure. Let Z = 3x – 4y be the objective function. Minimum of Z occurs at ______.


Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. The Minimum value of F occurs at  ______.


Refer to Question 32, Maximum of F – Minimum of F = ______.


In a LPP, the objective function is always ______.


In a LPP if the objective function Z = ax + by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same ______ value.


A corner point of a feasible region is a point in the region which is the ______ of two boundary lines.


The feasible region for an LPP is always a ______ polygon.


If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax + by may or may not exist.


Maximum value of the objective function Z = ax + by in a LPP always occurs at only one corner point of the feasible region.


In a LPP, the minimum value of the objective function Z = ax + by is always 0 if the origin is one of the corner point of the feasible region.


Based on the given shaded region as the feasible region in the graph, at which point(s) is the objective function Z = 3x + 9y maximum?


For an objective function Z = ax + by, where a, b > 0; the corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 20), (10, 10), (30, 30) and (0, 40). The condition on a and b such that the maximum Z occurs at both the points (30, 30) and (0, 40) is:


Z = 7x + y, subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.


In linear programming infeasible solutions


In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case the feasible region is unbounded, m is the minimum value of the objective function.


Maximize Z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.


Maximize Z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.


Z = 6x + 21 y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×