English

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:

Advertisements
Advertisements

Question

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?

Chart
Sum
Advertisements

Solution

Let there be x units of tablet X and y units of tablet Y

So, according to the given information, we have

6x + 2y ≥ 18

⇒ 3x + y ≥ 9  ......(i)

x 0 3
y 9 0

3x + 3y ≥ 21

⇒ x + y ≥ 7 ......(ii)

x 0 3
y 9 0

2x + 4y ≥ 16

⇒ x + 2y ≥ 8  ......(iii)

x 0 8
y 4 0

x ≥ 0, y ≥ 0  ......(iv)

The price of each table of X type is ` 2 and that of y is ` 1.

So, the required LPP is

Minimise Z = 2x + y subject to the constraints

3x + y ≥ 9, x + y ≥ 7, x + 2y ≥ 8, x ≥ 0, y ≥ 0

On solving (ii) and (iii) we get

x = 6 and y = 1

On solving (i) and (ii) we get

x = 1 and y = 6

From the graph, we see that the feasible region ABCD is unbounded whose corner points are A(8, 0), B(6, 1), C(1, 6) and D(0, 9).

Let us evaluate the value of Z

Corner points Value of Z = 2x + y  
A(8, 0) Z = 2(8) + 0 = 16  
B(6, 1) Z = 2(6) + 1 = 13  
C(1, 6) Z = 2(1) + 6 = 8 ← Minimum
D(0, 9) Z = 2(0) + 9 = 9  

Here, we see that 8 is the minimum value of Z at (1, 6) but the feasible region is unbounded.

So, 8 may or may not be the minimum value of Z.

To confirm it, we will draw a graph of inequality 2x + y < 8 and check if it has a common point.

We see from the graph that there is no common point on the line.

Hence, the minimum value of Z is 8 at (1, 6).

Tablet X = 1

Tablet Y = 6.

shaalaa.com
  Is there an error in this question or solution?
Chapter 12: Linear Programming - Exercise [Page 254]

APPEARS IN

NCERT Exemplar Mathematics Exemplar [English] Class 12
Chapter 12 Linear Programming
Exercise | Q 23 | Page 254

RELATED QUESTIONS

Two tailors, A and B, earn Rs 300 and Rs 400 per day respectively. A can stitch 6 shirts and 4 pairs of trousers while B can stitch 10 shirts and 4 pairs of trousers per day. To find how many days should each of them work and if it is desired to produce at least 60 shirts and 32 pairs of trousers at a minimum labour cost, formulate this as an LPP


Solve the following Linear Programming Problems graphically:

Minimise Z = 3x + 5y

such that x + 3y ≥ 3, x + y ≥ 2, 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.


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.

 


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.


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.


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


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


Minimise Z = 13x – 15y subject to the constraints: x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥ 0, y ≥ 0


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


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 quastion 12. What will be the minimum cost?


Refer to question 14. How many sweaters of each type should the company make in a day to get a maximum profit? What is the maximum profit.


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


Refer to Question 27. Maximum of Z occurs at ______.


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 ____________.


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


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.


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 ____________.


A linear programming problem is one that is concerned with ____________.


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.


In a LPP, the objective function is always ____________.


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


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


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


Which statement best describes a Linear Programming Problem (LPP)?


In the expression \[Z=250x+75y\], which quantities are the decision variables?


Which statement defines an Optimisation Problem?


Which other constraint must be satisfied together with \[5x+y\leq 100\] in the profit-maximization formulation?


What are restrictions on decision variables called in linear programming?


Which component must always be included in a Linear Programming Problem?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×