मराठी

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

प्रश्न

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?

तक्ता
बेरीज
Advertisements

उत्तर

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
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 12: Linear Programming - Exercise [पृष्ठ २५४]

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics Exemplar [English] Class 12
पाठ 12 Linear Programming
Exercise | Q 23 | पृष्ठ २५४

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

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

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 = 3x + 5y

such that x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0.


Solve the following Linear Programming Problems graphically:

Maximise Z = 3x + 2y

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


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

Minimise and Maximise Z = x + 2y 

subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.


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?

 


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


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.


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


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


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 region for an LPP is shown in the figure. Let F = 3x – 4y be the objective function. Maximum value of F is ______.


If the feasible region for a LPP is ______ then the optimal value of the objective function Z = ax + by may or may not exist.


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


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?


In the given graph, the feasible region for an LPP is shaded. The objective function Z = 2x – 3y will be minimum at:


A linear programming problem is as follows:

Minimize Z = 30x + 50y

Subject to the constraints: 3x + 5y ≥ 15, 2x + 3y ≤ 18, x ≥ 0, y ≥ 0

In the feasible region, the minimum value of Z occurs at:


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:


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


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


In linear programming infeasible solutions


In linear programming, optimal solution ____________.


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


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


What are constraints in a Linear Programming Problem?


Which inequality is one of the given resource constraints in the formulation with objective function \[Z=250x+75y\]?


Which set gives the complete non-negative restrictions for the profit-maximization formulation?


Linear Programming is a method of optimisation under which type of constraints?


What is the name of the quantity to be optimised in linear programming?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×