हिंदी

A Dietician Wishes to Mix Together Two Kinds of Food X and Y in Such a Way that the Mixture Contains at Least 10 Units of Vitamin A, 12 Units of Vitamin B and 8 Units of Vitamin C. One Kg of Food X Costs Rs 16 and One Kg of Food Y Costs Rs 20. Find the Least Cost of the Mixture Which Will Produce the Required Diet?

Advertisements
Advertisements

प्रश्न

A dietician wishes to mix together two kinds of food X and Y in such a way that the mixture contains at least 10 units of vitamin A, 12 units of vitamin B and 8 units of vitamin C. The vitamin content of one kg food is given below:

Food Vitamin A Vitamin B Vitamin C
X 1 2 3
Y 2 2 1

One kg of food X costs Rs 16 and one kg of food Y costs Rs 20. Find the least cost of the mixture which will produce the required diet?

 

Advertisements

उत्तर

Let the mixture contain x kg of food X and y kg of food Y.

The mathematical formulation of the given problem is as follows.

Minimize z = 16x + 20y … (1)

subject to the constraints,

The feasible region determined by the system of constraints is as follows.

The corner points of the feasible region are A (10, 0), B (2, 4), C (1, 5), and D (0, 8).

The values of z at these corner points are as follows.

Corner point z = 16x + 20  
A (10, 0) 160  
B (2, 4) 112 → Minimum
C (1, 5) 116  
D (0, 8) 160  

As the feasible region is unbounded, therefore, 112 may or may not be the minimum value of z.

For this, we draw a graph of the inequality, 16x + 20y < 112 or 4x + 5y < 28, and check whether the resulting half plane has points in common with the feasible region or not.

It can be seen that the feasible region has no common point with 4x + 5y < 28

Therefore, the minimum value of z is 112 at (2, 4).

Thus, the mixture should contain 2 kg of food X and 4 kg of food Y. The minimum cost of the mixture is Rs 112

 

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 12: Linear Programming - Exercise 12.3 [पृष्ठ ५२६]

APPEARS IN

एनसीईआरटी Mathematics Part 1 and 2 [English] Class 12
अध्याय 12 Linear Programming
Exercise 12.3 | Q 3 | पृष्ठ ५२६

वीडियो ट्यूटोरियलVIEW ALL [2]

संबंधित प्रश्न

Solve the following Linear Programming Problems graphically:

Maximise Z = 3x + 2y

subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0.


Solve the following Linear Programming Problems graphically:

Minimise Z = x + 2y

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


Show that the minimum of Z occurs at more than two points.

Maximise Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, y ≥ 0.


Refer to Example 9. How many packets of each food should be used to maximize the amount of vitamin A in the diet? What is the maximum amount of vitamin A in the diet?


A farmer mixes two brands P and Q of cattle feed. Brand P, costing Rs 250 per bag contains 3 units of nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing Rs 200 per bag contains 1.5 units of nutritional elements A, 11.25 units of element B, and 3 units of element C. The minimum requirements of nutrients A, B and C are 18 units, 45 units and 24 units respectively. Determine the number of bags of each brand which should be mixed in order to produce a mixture having a minimum cost per bag? What is the minimum cost of the mixture per bag?


A manufacturer makes two types of toys A and B. Three machines are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:

Type of toy Machines
I II III
A 12 18 6
B 6 0 9

Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A is Rs 7.50 and that on each toy of type B is Rs 5, show that 15 toys of type A and 30 of type B should be manufactured in a day to get maximum profit.

 


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.


The minimum value of the objective function Z = ax + by in a linear programming problem always occurs at only one corner point of the feasible region


Determine the maximum value of Z = 11x + 7y subject to the constraints : 2x + y ≤ 6, x ≤ 2, x ≥ 0, y ≥ 0.


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


Feasible region (shaded) for a LPP is shown in Figure. Maximise Z = 5x + 7y.


The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y


The feasible region for a LPP is shown in figure. Evaluate Z = 4x + y at each of the corner points of this region. Find the minimum value of Z, if it exists.


Refer to quastion 12. What will be the minimum cost?


A company makes 3 model of calculators: A, B and C at factory I and factory II. The company has orders for at least 6400 calculators of model A, 4000 calculator of model B and 4800 calculator of model C. At factory I, 50 calculators of model A, 50 of model B and 30 of model C are made every day; at factory II, 40 calculators of model A, 20 of model B and 40 of model C are made everyday. It costs Rs 12000 and Rs 15000 each day to operate factory I and II, respectively. Find the number of days each factory should operate to minimise the operating costs and still meet the demand.


The feasible region for an LPP is shown in the figure. Let F = 3x – 4y be the objective function. Maximum value of F is ______.


In a LPP, the linear inequalities or restrictions on the variables are called ____________.


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.


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:


In a linear programming problem, the constraints on the decision variables x and y are x − 3y ≥ 0, y ≥ 0, 0 ≤ x ≤ 3. The feasible region:


The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x - 2y ≥ 0, x ≥ 0, y ≥ 0 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. If M and m respectively be the largest and smallest values at corner points then ____________.


Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.


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.


Maximize Z = 10 x1 + 25 x2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.


The feasible region for an LPP is shown shaded in the figure. Let Z = 3x - 4y be the objective function. Minimum of Z occurs at ____________.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×