मराठी

There Are Two Factories Located One at Place P and the Other at Place Q. from These Locations, a Certain Commodity is to Be Delivered to Each of the Three Depots Situated at A, B and C - Mathematics

Advertisements
Advertisements

प्रश्न

There are two factories located one at place P and the other at place Q. From these locations, a certain commodity is to be delivered to each of the three depots situated at A, B and C. The weekly requirements of the depots are respectively 5, 5 and 4 units of the commodity while the production capacity of the factories at P and Q are respectively 8 and 6 units. The cost of transportation per unit is given below:
 

From \ To Cost (in ₹)
  A B C
P 160 100 150
Q 100 120 100


How many units should be transported from each factory to each depot in order that the transportation cost is minimum. What will be the minimum transportation cost?

बेरीज

उत्तर

Here, demand of the commodity (5 + 5 + 4 = 14 units) is equal the supply of the commodity (8 + 6 = 14 units). So, no commodity would be left at the two factories.

Let x units and y units of the commodity be transported from the factory P to the depots at A and B, respectively.

Then, (8 − x − y) units of the commodity will be transported from the factory P to the depot C.

Now, the weekly requirement of depot A is 5 units of the commodity. Now, x units of the commodity are transported from factory P, so the remaining (5 − x) units of the commodity are transported from the factory Q to the depot A.

The weekly requirement of depot B is 5 units of the commodity. Now, y units of the commodity are transported from factory P, so the remaining (5 − y) units of the commodity are transported from the factory Q to the depot B.

Similarly, 6 − (5 − x) − (5 − y) = (x + − 4) units of the commodity will be transported from the factory Q to the depot C.

Since the number of units of commodity transported are from the factories to the depots are non-negative, therefore,

x ≥ 0, y ≥ 0, 8 − x − ≥ 0, 5 − ≥ 0, 5 − ≥ 0, x + − 4 ≥ 0

Or x ≥ 0, y ≥ 0, x + y ≤ 8, ≤ 5, ≤ 5, x + y ≥ 4

Total transportation cost = 160x + 100y + 150(8 − x − y) + 100(5 − x) + 120(5 − y) + 100(x + − 4) = 10x − 70y + 1900

Thus, the given linear programming problem is

Minimise Z = 10x − 70y + 1900

subject to the constraints

x + y ≤ 8

≤ 5

≤ 5

x + y ≥ 4

x ≥ 0, y ≥ 0

The feasible region determined by the given constraints can be diagrammatically represented as,

The coordinates of the corner points of the feasible region are A(4, 0), B(5, 0), C(5, 3), D(3, 5), E(0, 5) and F(0, 4).

The value of the objective function at these points are given in the following table.
 

Corner Point Z = 10x  70+ 1900
(4, 0)  10 × 4 − 70 × 0 + 1900 = 1940
(5, 0)  10 × 5 − 70 × 0 + 1900 = 1950
(5, 3)     10 × 5 − 70 × 3 + 1900 = 1740   
(3, 5) 10 × 3 − 70 × 5 + 1900 = 1580
(0, 5) 10 × 0 − 70 × 5 + 1900 = 1550 → Minimum
(0, 4) 10 × 0 − 70 × 4 + 1900 = 1620

The minimum value of Z is 1550 at x = 0, y = 5.

Hence, for minimum transportation cost, factory P should supply 0, 5, 3 units of commodity to depots A, B, C respectively and factory Q should supply 5, 0, 1 units of commodity to depots A, B, C respectively.

The minimum transportation cost is ₹1,550.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 30: Linear programming - Exercise 30.4 [पृष्ठ ५७]

APPEARS IN

आरडी शर्मा Mathematics [English] Class 12
पाठ 30 Linear programming
Exercise 30.4 | Q 49 | पृष्ठ ५७

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

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

Minimize : Z = 6x + 4y

Subject to the conditions:

3x + 2y ≥ 12,

x + y ≥ 5,

0 ≤ x ≤ 4,

0 ≤ y ≤ 4


Solve the following LPP by using graphical method.

Maximize : Z = 6x + 4y

Subject to x ≤ 2, x + y ≤  3, -2x + y ≤  1, x ≥  0, y ≥ 0.

Also find maximum value of Z.


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.


Solve the following L.P.P graphically:

Maximize: Z = 10x + 25y
Subject to: x ≤ 3, y ≤ 3, x + y ≤ 5, x ≥ 0, y ≥ 0


Minimum and maximum z = 5x + 2y subject to the following constraints:

x-2y ≤ 2

3x+2y ≤ 12

-3x+2y ≤ 3

x ≥ 0,y ≥ 0


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 LPP by graphical method:

Minimize Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0


A dietician wishes to mix 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 arid 8 units of vitamin C. The vitamin contents of one kg food is given below:

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

Orie kg of food X costs Rs 24 and one kg of food Y costs Rs 36. Using Linear Programming, find the least cost of the total mixture. which will contain the required vitamins.


Maximise z = 8x + 9y subject to the constraints given below :
2x + 3y ≤ 6
3x − 2y ≤6
y ≤ 1
xy ≥ 0


Minimize Z = 5x + 3y
Subject to 

\[2x + y \geq 10\]
\[x + 3y \geq 15\]
\[ x \leq 10\]
\[ y \leq 8\]
\[ x, y \geq 0\]

 


Find the maximum and minimum value of 2x + y subject to the constraints:
x + 3y ≥ 6, x − 3y ≤ 3, 3x + 4y ≤ 24, − 3x + 2y ≤ 6, 5x + y ≥ 5, xy ≥ 0.


Solved the following linear programming problem graphically:
Maximize Z = 60x + 15y
Subject to constraints

\[x + y \leq 50\]
\[3x + y \leq 90\]
\[ x, y \geq 0\]


To maintain one's health, a person must fulfil certain minimum daily requirements for the following three nutrients: calcium, protein and calories. The diet consists of only items I and II whose prices and nutrient contents are shown below:

  Food I Food II Minimum daily requirement
Calcium
Protein
Calories
10
5
2
4
6
6
20
20
12
Price Rs 0.60 per unit Rs 1.00 per unit  

Find the combination of food items so that the cost may be minimum.


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.


A factory manufactures two types of screws, A and B, each type requiring the use of two machines - an automatic and a hand-operated. It takes 4 minute on the automatic and 6 minutes on the hand-operated machines to manufacture a package of screws 'A', while it takes 6 minutes on the automatic and 3 minutes on the hand-operated machine to manufacture a package of screws 'B'. Each machine is available for at most 4 hours on any day. The manufacturer can sell a package of screws 'A' at a profit of 70 P and screws 'B' at a profit of Rs 1. Assuming that he can sell all the screws he can manufacture, how many packages of each type should the factory owner produce in a day in order to maximize his profit? Determine the maximum profit.


A factory uses three different resources for the manufacture of two different products, 20 units of the resources A, 12 units of B and 16 units of C being available. 1 unit of the first product requires 2, 2 and 4 units of the respective resources and 1 unit of the second product requires 4, 2 and 0 units of respective resources. It is known that the first product gives a profit of 2 monetary units per unit and the second 3. Formulate the linear programming problem. How many units of each product should be manufactured for maximizing the profit? Solve it graphically.


A firm manufactures headache pills in two sizes A and B. Size A contains 2 grains of aspirin, 5 grains of bicarbonate and 1 grain of codeine; size B contains 1 grain of aspirin, 8 grains of bicarbonate and 66 grains of codeine. It has been found by users that it requires at least 12 grains of aspirin, 7.4 grains of bicarbonate and 24 grains of codeine for providing immediate effects. Determine graphically the least number of pills a patient should have to get immediate relief. Determine also the quantity of codeine consumed by patient.


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 of product A and 16 of product B. A working week consists of 40 hours of production and weekly turnover must not be less than Rs 10000. If the profit on each of product A is Rs 20 and on product B is Rs 30, then how many of each should be produced so that the profit is maximum. Also, find the maximum profit.


A manufacturer produces two types of steel trunks. He has two machines A and B. For completing, the first types of the trunk requires 3 hours on machine A and 3 hours on machine B, whereas the second type of the trunk requires 3 hours on machine A and 2 hours on machine B. Machines A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of Rs 30 and Rs 25 per trunk of the first type and the second type respectively. How many trunks of each type must he make each day to make maximum profit?


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 box manufacturer makes large and small boxes from a large piece of cardboard. The large boxes require 4 sq. metre per box while the small boxes require 3 sq. metre per box. The manufacturer is required to make at least three large boxes and at least twice as many small boxes as large boxes. If 60 sq. metre of cardboard is in stock, and if the profits on the large and small boxes are Rs 3 and Rs 2 per box, how many of each should be made in order to maximize the total profit?


If a young man drives his vehicle at 25 km/hr, he has to spend ₹2 per km on petrol. If he drives it at a faster speed of 40 km/hr, the petrol cost increases to ₹5 per km. He has ₹100 to spend on petrol and travel within one hour. Express this as an LPP and solve the same.  


A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time and 3 hours of craftman's time in its making while a cricket bat takes 3 hours of machine time and 1 hour of craftman's time. In a day, the factory has the availability of not more than 42 hours of machine time and 24 hours of craftman's time. If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the number of tennis rackets and cricket bats that the factory must manufacture to earn the maximum profit. Make it as an LPP and solve it graphically.


There are two types of fertilizers Fand F2. Fconsists of 10% nitrogen and 6% phosphoric acid and ​Fconsists of 5% nitrogen and 10% phosphoric acid. After testing the soil conditions, a farmer finds the she needs atleast 14 kg of nitrogen and 14 kg of phosphoric acid for her crop. If Fcosts ₹6/kg and Fcosts ₹5/kg, determine how much of each type of fertilizer should be used so that the nutrient requirements are met at minimum cost. What is the minimum cost? 


Tow godowns, A and B, have grain storage capacity of 100 quintals and 50 quintals respectively. They supply to 3 ration shops, DE and F, whose requirements are 60, 50 and 40 quintals respectively. The cost of transportation per quintal from the godowns to the shops are given in the following table:

  Transportation cost per quintal(in Rs.)
From-> A B
To
D 6.00 4.00
E 3.00 2.00
F 2.50 3.00

How should the supplies be transported in order that the transportation cost is minimum?


The region represented by the inequation system xy ≥ 0, y ≤ 6, x + y ≤ 3 is 


The value of objective function is maximum under linear constraints ______.


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


If 4x + 5y ≤ 20, x + y ≥ 3, x ≥ 0, y ≥ 0, maximum 2x + 3y 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 ______.


A set of values of decision variables which satisfies the linear constraints and nn-negativity conditions of an L.P.P. is called its ____________.


In Corner point method for solving a linear programming problem the first step is to ____________.


The feasible region (shaded) for a L.P.P is shown in the figure. The maximum Z = 5x + 7y is ____________.


The corner points of the shaded unbounded feasible region of an LPP are (0, 4), (0.6, 1.6) and (3, 0) as shown in the figure. The minimum value of the objective function Z = 4x + 6y occurs at ______.


The maximum value of 2x + y subject to 3x + 5y ≤ 26 and 5x + 3y ≤ 30, x ≥ 0, y ≥ 0 is ______.


Solve the following linear programming problem graphically:

Minimize: Z = 5x + 10y

Subject to constraints:

x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0.


The feasible region corresponding to the linear constraints of a Linear Programming Problem is given below.


Which of the following is not a constraint to the given Linear Programming Problem?


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×