मराठी

A Medical Company Has Factories at Two Places, a and B. from These Places, Supply is Made to Each of Its Three Agencies Situated at P, Q and R. the Monthly Requirements of Agencies Are Respectively

Advertisements
Advertisements

प्रश्न

A medical company has factories at two places, A and B. From these places, supply is made to each of its three agencies situated at PQ and R. The monthly requirements of the agencies are respectively 40, 40 and 50 packets of the medicines, while the production capacity of the factories, A and B, are 60 and 70 packets respectively. The transportation cost per packet from the factories to the agencies are given below:

Transportation Cost per packet(in Rs.)
From-> A B
To 
P 5 4
Q 4 2
R 3 5
 How many packets from each factory be transported to each agency so that the cost of transportation is minimum? Also find the minimum cost?
बेरीज
Advertisements

उत्तर

Let x and y packets be transported from factory A to the agencies P and Q respectively. Then, [60 − (x + y)] packets be transported to the agency R.
The requirement at agency P is 40 packets. Since, x packets are transported from factory A, 
Therefore, the remaining (40 − x) packets are transported from factory B.
Similarly, (40 − y) packets are transported by B to Q and 50− [60 − (x + y)] i.e. (x + y − 10) packets will be transported from factory B to agency R respectively.

Number of packets cannot be negative.Therefore,

\[x \geq 0, y \geq 0 \text{ and }  60 - x - y \geq 0\]

\[ \Rightarrow x \geq 0, y \geq 0 \text{ and }  x + y \leq 60\]

\[40 - x \geq 0, 40 - y \geq 0 \text{ and } x + y - 10 \geq 0\]

\[ \Rightarrow x \leq 40, y \leq 40 \text{ and }  x + y \geq 10\]

Total transportation cost Z is given by,

\[Z = 5x + 4y + 3\left[ 60 - \left( x + y \right) \right] + 4\left( 40 - x \right) + 2\left( 40 - y \right) + 5\left( x + y - 10 \right)\]
\[ = 3x + 4y + 10\]

Minimize Z =   \[5x + 4y + 3\left( 60 - x - y \right) + 4\left( 40 - x \right) + 2\left( 40 - y \right) + 5\left( x + y - 10 \right)\]
= \[3x + 4y + 370\]
subject to

\[x + y \leq 60\]

\[x \leq 40\]

\[y \leq 40\]

\[x + y \geq 10\]

\[x, y \geq 0\]

First we will convert inequations into equations as follows:
x + y = 60, x = 40, y = 40, y = 10, x = 0 and y = 0

Region represented by x + y ≤ 60:
The line x + y = 60 meets the coordinate axes at A1(60, 0) and B1(0, 60) respectively. By joining these points we obtain the line x + y = 60. Clearly (0,0) satisfies the x + y = 60. So, the region which contains the origin represents the solution set of the inequation x + y ≤ 60.

Region represented by x ≤ 40:
x = 40 is the line that passes C1(40, 0) and is parallel to the Y axis.The region to the left of the line = 40 will satisfy the inequation x ≤ 40.

Region represented by y ≤ 40:
y = 40 is the line that passes D1(0, 40) and is parallel to the X axis . The region below the line = 40 will satisfy the inequation y ≤ 40.

Region represented by x y ≥ 10:
The line x + y = 10 meets the coordinate axes at E1(10, 0) and \[F_1 \left( 0, 10 \right)\]  respectively. By joining these points we obtain the line x + y = 10. Clearly (0,0) does not satisfies the inequation x y ≥ 10. So,the region which does not contain the origin represents the solution set of the inequation x y ≥ 10.

Region represented by ≥ 0 and y ≥ 0:
Since, every point in the first quadrant satisfies these inequations. So, the first quadrant is the region represented by the inequations x ≥ 0, and y ≥ 0.

The feasible region determined by the system of constraints x + y ≤ 60, x ≤ 40, y ≤ 40, x y ≥ 10, x ≥ 0 and y ≥ 0 are as follows.
The corner points are D1(0, 40), H1(20, 40), G1(40, 20), C1(40, 0), E1(10, 0) and F1(0, 10). 
The values of Z at these corner points are as follows
 
Corner point Z= 3x + 4y + 370
D1 530
H1 590
G1 570
C1 490
E1 400
F1 410

The minimum value of Z is 400 which is at E1(10, 0).
Thus, the minimum cost is Rs 400.
Hence, 
From A: 10 packets, 0 packets and 50 packets to P, Q and R respectively
From B: 30 packets, 40 packets and 0 packets to P, Q and R respectively​
 
shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 29: Linear programming - Exercise 30.5 [पृष्ठ ६५]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
पाठ 29 Linear programming
Exercise 30.5 | Q 2 | पृष्ठ ६५

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

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

Minimize `z=4x+5y ` subject to `2x+y>=7, 2x+3y<=15, x<=3,x>=0, y>=0` solve using graphical method.


A dealer in rural area wishes to purchase a number of sewing machines. He has only Rs 5,760 to invest and has space for at most 20 items for storage. An electronic sewing machine cost him Rs 360 and a manually operated sewing machine Rs 240. He can sell an electronic sewing machine at a profit of Rs 22 and a manually operated sewing machine at a profit of Rs 18. Assuming that he can sell all the items that he can buy, how should he invest his money in order to maximize his profit? Make it as a LPP and solve it graphically.


A manufacturer produces two products A and B. Both the products are processed on two different machines. The available capacity of first machine is 12 hours and that of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at Rs 7 profit and  B at a profit of Rs 4. Find the production level per day for maximum profit graphically.


Solve the following L.P.P. graphically Maximise Z = 4x + y 

Subject to following constraints  x + y ≤ 50

3x + y ≤ 90,

x ≥ 10

x, y ≥ 0


Solve the following L.P.P graphically: Maximise Z = 20x + 10y

Subject to the following constraints x + 2y ≤ 28,

3x + y ≤ 24,

x ≥ 2,

 x, y ≥ 0


Maximize Z = 4x + 3y
subject to

\[3x + 4y \leq 24\]
\[8x + 6y \leq 48\]
\[ x \leq 5\]
\[ y \leq 6\]
\[ x, y \geq 0\]


Maximize Z = 3x + 4y
Subject to

\[2x + 2y \leq 80\]
\[2x + 4y \leq 120\]


Maximize Z = 3x + 5y
Subject to

\[x + 2y \leq 20\]
\[x + y \leq 15\]
\[ y \leq 5\]
\[ x, y \geq 0\]


A diet is to contain at least 80 units of vitamin A and 100 units of minerals. Two foods F1and F2 are available. Food F1 costs Rs 4 per unit and F2 costs Rs 6 per unit one unit of food F1 contains 3 units of vitamin A and 4 units of minerals. One unit of food F2contains 6 units of vitamin A and 3 units of minerals. Formulate this as a linear programming problem and find graphically the minimum cost for diet that consists of mixture of these foods and also meets the mineral nutritional requirements


Kellogg is a new cereal formed of a mixture of bran and rice that contains at least 88 grams of protein and at least 36 milligrams of iron. Knowing that bran contains 80 grams of protein and 40 milligrams of iron per kilogram, and that rice contains 100 grams of protein and 30 milligrams of iron per kilogram, find the minimum cost of producing this new cereal if bran costs Rs 5 per kg and rice costs Rs 4 per kg


A wholesale dealer deals in two kinds, A and B (say) of mixture of nuts. Each kg of mixture A contains 60 grams of almonds, 30 grams of  cashew nuts and 30 grams of hazel nuts. Each kg of mixture B contains 30 grams of almonds, 60 grams of cashew nuts and 180 grams of hazel nuts. The remainder of both mixtures is per nuts. The dealer is contemplating to use mixtures A and B to make a bag which will contain at least 240 grams of almonds, 300 grams of cashew nuts and 540 grams of hazel nuts. Mixture A costs Rs 8 per kg. and mixture B costs Rs 12 per kg. Assuming that mixtures A and B are uniform, use graphical method to determine the number of kg. of each mixture which he should use to minimise the cost of the bag.


Two tailors, A and B earn Rs 15 and Rs 20 per day respectively. A can stitch 6 shirts and 4 pants  while B can stitch 10 shirts and 4 pants per day. How many days shall each work if it is desired to produce (at least) 60 shirts and 32 pants at a minimum labour cost?


A chemical company produces two compounds, A and B. The following table gives the units of ingredients, C and D per kg of compounds A and B as well as minimum requirements of C and D and costs per kg of A and B. Find the quantities of A and B which would give a supply of C and D at a minimum cost.

  Compound Minimum requirement
A B  
Ingredient C
Ingredient D
1
3
2
1
80
75
Cost (in Rs) per kg 4 6 -

Anil wants to invest at most Rs 12000 in Saving Certificates and National Saving Bonds. According to rules, he has to invest at least Rs 2000 in Saving Certificates and at least Rs 4000 in National Saving Bonds. If the rate of interest on saving certificate is 8% per annum and the rate of interest on National Saving Bond is 10% per annum, how much money should he invest to earn maximum yearly income? Find also his maximum yearly income.


A producer has 30 and 17 units of labour and capital respectively which he can use to produce two type of goods x and y. To produce one unit of x, 2 units of labour and 3 units of capital are required. Similarly, 3 units of labour and 1 unit of capital is required to produce one unit of y. If x and y are priced at Rs 100 and Rs 120 per unit respectively, how should be producer use his resources to maximize the total revenue? Solve the problem graphically.


A small firm manufacturers items A and B. The total number of items A and B that it can manufacture in a day is at the most 24. Item A takes one hour to make while item B takes only half an hour. The maximum time available per day is 16 hours. If the profit on one unit of item A be Rs 300 and one unit of item B be Rs 160, how many of each type of item be produced to maximize the profit? Solve the problem graphically.


A company sells two different products, A and B. The two products are produced in a common production process, which has a total capacity of 500 man-hours. It takes 5 hours to produce a unit of A and 3 hours to produce a unit of B. The market has been surveyed and company officials feel that the maximum number of unit of A that can be sold is 70 and that for B is 125. If the profit is Rs 20 per unit for the product A and Rs 15 per unit for the product B, how many units of each product should be sold to maximize profit?


A manufacturer makes two products, A and B. Product A sells at Rs 200 each and takes 1/2 hour to make. Product B sells at Rs 300 each and takes 1 hour to make. There is a permanent order for 14 units of product A and 16 units of product B. A working week consists of 40 hours of production and the weekly turn over must not be less than Rs 10000. If the profit on each of product A is Rs 20 and an product B is Rs 30, then how many of each should be produced so that the profit is maximum? Also find the maximum profit.

 


An oil company has two depots, A and B, with capacities of 7000 litres and 4000 litres respectively. The company is to supply oil to three petrol pumps, DEF whose requirements are 4500, 3000 and 3500 litres respectively. The distance (in km) between the depots and petrol pumps is given in the following table:
Figure
Assuming that the transportation cost per km is Rs 1.00 per litre, how should the delivery be scheduled in order that the transportation cost is minimum?


A small firm manufactures gold rings and chains. The total number of rings and chains manufactured per day is at most 24. It takes 1 hour to make a ring and 30 minutes to make a chain. The maximum number of hours available per day is 16. If the profit on a ring is Rs 300 and that on a chain is Rs 190, find the number of rings and chains that should be manufactured per day, so as to earn the maximum profit. Make it as an LPP and solve it graphically.


A merchant plans to sell two types of personal computers a desktop model and a portable model that will cost Rs 25,000 and Rs 40,000 respectively. He estimates that the total monthly demand of computers will not exceed 250 units. Determine the number of units of each type of computers which the merchant should stock to get maximum profit if he does not want to invest more than Rs 70 lakhs and his profit on the desktop model is Rs 4500 and on the portable model is Rs 5000. 


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:
 

Types of Toys 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 ₹7.50 and that on each toy of type B is ₹5, show that 15 toys of type A and 30 toys of type B should be manufactured in a day to get maximum profit.

 There are two types of fertilisers 'A' and 'B' . 'A' consists of 12% nitrogen and 5% phosphoric acid whereas 'B' consists of 4% nitrogen and 5% phosphoric acid. After testing the soil conditions, farmer finds that he needs at least 12 kg of nitrogen and 12 kg of phosphoric acid for his crops. If 'A' costs ₹10 per kg and 'B' cost ₹8 per kg, then graphically determine how much of each type of fertiliser should be used so that nutrient requiremnets are met at a minimum cost


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.


The graph of the inequality 3X − 4Y ≤ 12, X ≤ 1, X ≥ 0, Y ≥ 0 lies in fully in


Find the graphical solution for the system of linear inequation 2x + y ≤ 2, x − y ≤ 1


The maximum value of z = 6x + 8y subject to x - y ≥ 0, x + 3y ≤ 12, x ≥ 0, y ≥ 0 is ______.


The minimum value of z = 2x + 9y subject to constraints x + y ≥ 1, 2x + 3y ≤ 6, x ≥ 0, y ≥ 0 is ______.


The maximum value of z = 3x + 10y subjected to the conditions 5x + 2y ≤ 10, 3x + 5y ≤ 15, x, y ≥ 0 is ______.


The maximum of z = 5x + 2y, subject to the constraints x + y ≤ 7, x + 2y ≤ 10, x, y ≥ 0 is ______.


Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is ______.


Z = 20x1 + 20x2, subject to x1 ≥ 0, x2 ≥ 0, x1 + 2x2 ≥ 8, 3x1 + 2x2 ≥ 15, 5x1 + 2x2 ≥ 20. The minimum value of Z occurs at ____________.


The corner points of the bounded feasible region of a LPP are A(0,50), B(20, 40), C(50, 100) and D(0, 200) and the objective function is Z = x + 2y. Then the maximum value is ____________.


Which of the statements describe the solution set for `-2(x + 8) = - 2x + 20`?


The constraints –x1 + x2 ≤ 1, –x1 + 3x2 ≤ 9, x1x2 ≥ 0 define on ______.


The objective function Z = ax + by of an LPP has maximum vaiue 42 at (4, 6) and minimum value 19 at (3, 2). Which of the following is true?


Solve the following Linear Programming Problem graphically.

Maximise Z = 5x + 2y subject to:

x – 2y ≤ 2,

3x + 2y ≤ 12,

– 3x + 2y ≤ 3,

x ≥ 0, y ≥ 0


If x – y ≥ 8, x ≥ 3, y ≥ 3, x ≥ 0, y ≥ 0 then find the coordinates of the corner points of the feasible region.


The solution set of constraints x + 2y ≥ 11, 3x + 4y  ≤  30, 2x + 5y ≤ 30 and x ≥ 0, y ≥ 0, includes the point ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×