मराठी

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:

Minimise Z = – 3x + 4 y

subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0.


Solve the following Linear Programming Problems graphically:

Maximise Z = 5x + 3y

subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, 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.


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.


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.


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


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 question 13. Solve the linear programming problem and determine the maximum profit to the manufacturer


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 solution for a LPP is shown in Figure. Let Z = 3x – 4y be the objective function. Minimum of Z occurs at ______.


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


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


In a LPP, the maximum value of the objective function Z = ax + by is always finite.


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:


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:


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, optimal solution ____________.


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


If two corner points of the feasible region are both optimal solutions of the same type, i.e., both produce the same maximum or minimum.


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.


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


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


What are constraints in a Linear Programming Problem?


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?


What are the unknown quantities in a Linear Programming Problem called?


What are restrictions on decision variables called in linear programming?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×