हिंदी

A cooperative society of farmers has 50 hectares of land to grow two crops A and B. The profits from crops A and B per hectare are estimated as Rs 10,500 and Rs 9,000 respectively. - Mathematics

Advertisements
Advertisements

प्रश्न

A cooperative society of farmers has 50 hectares of land to grow two crops A and B. The profits from crops A and B per hectare are estimated as Rs 10,500 and Rs 9,000 respectively. To control weeds, a liquid herbicide has to be used for crops A and B at the rate of 20 litres and 10 litres per hectare, respectively. Further not more than 800 litres of herbicide should be used in order to protect fish and wildlife using a pond which collects drainage from this land. Keeping in mind that the protection of fish and other wildlife is more important than earning profit, how much land should be allocated to each crop so as to maximize the total profit? Form an LPP from the above and solve it graphically. Do you agree with the message that the protection of wildlife is utmost necessary to preserve the balance in environment?

उत्तर

Let the land allocated for crop A be x hectares and crop B be y hectares.

Maximum area of the land available for two crops is 50 hectares.

x + y ≤ 50

Liquid herbicide to be used for crops A and B are at the rate of 20 litres and 10 litres per hectare respectively. Maximum amount of herbicide to be used is 800 litres.

∴ 20x + 10 y ≤ 800

⇒ 2x + y ≤ 80

The profits from crops A and B per hectare are Rs 10,500 and Rs 9,000 respectively.

Thus, total profit = Rs (10,500x + 9,000y) = Rs 1500 (7x + 6y)

Therefore, the mathematical formulation of the given problem is

Maximize Z = 1500 (7x + 6y) subject to the constraints

x + y ≤ 50 … (1)

2x + y ≤ 80 … (2)

x ≥ 0 … (3)

y ≥ 0 … (4)

The feasible region determined by constraints (1), (2), (3) and (4) is represented by the shaded region in the following graph:

The corner points of the feasible region are O (0, 0), A (40, 0), B (30, 20) and C (0, 50).

The values of Z at these corner points are calculated as:

Corner point

Z = 1500 (7x + 6y)

 

O (0, 0)

0

 

A (40, 0)

420000

 

B (30, 20)

495000

←Maximum

C (0, 50)

420000

 

The maximum profit is at point B (30, 20).

Therefore, 30 hectares of land should be allocated for crop A and 20 hectares of land should be allocated for crop B.

The maximum profit is Rs 495000.

Yes, we agree that the protection of wildlife is utmost necessary to preserve the balance in environment.

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
2012-2013 (March) Delhi Set 1

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

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

Minimize :Z=6x+4y

Subject to : 3x+2y ≥12

x+y ≥5

0 ≤x ≤4

0 ≤ y ≤ 4 


Solve the following LPP by graphical method:

Maximize: z = 3x + 5y
Subject to:  x + 4y ≤ 24
                  3x + y ≤ 21
                  x + y ≤ 9
                  x ≥ 0, y ≥ 0


Solve the following LPP graphically :
Maximise Z = 105x + 90y
subject to the constraints
x + y ≤ 50
2x + y ≤ 80
x ≥ 0, y ≥ 0.


Minimize Z = 18x + 10y
Subject to 

\[4x + y \geq 20\]
\[2x + 3y \geq 30\]
\[ x, y \geq 0\]


Maximize Z = 50x + 30y
Subject to 

\[2x + y \leq 18\]
\[3x + 2y \leq 34\]
\[ x, y \geq 0\]


Maximize Z = 15x + 10y
Subject to 

\[3x + 2y \leq 80\]
\[2x + 3y \leq 70\]
\[ x, y \geq 0\]

 


Maximize Z = x + y
Subject to

\[- 2x + y \leq 1\]
\[ x \leq 2\]
\[ x + y \leq 3\]
\[ x, y \geq 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\]


Find graphically, the maximum value of Z = 2x + 5y, subject to constraints given below:

2x + 4y ≤ 8
3x + y ≤ 6
x + y ≤ 4 
x ≥ 0, ≥ 0   


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 manufacturer has three machines installed in his factory. machines I and II are capable of being operated for at most 12 hours whereas Machine III must operate at least for 5 hours a day. He produces only two items, each requiring the use of three machines. The number of hours required for producing one unit each of the items on the three machines is given in the following table:

Item Number of hours required by the machine

A
B
I II III
1
2
2
1
1
5/4

He makes a profit of Rs 6.00 on item A and Rs 4.00 on item B. Assuming that he can sell all that he produces, how many of each item should he produces so as to maximize his profit? Determine his maximum profit. Formulate this LPP mathematically and then solve it.


A company produces two types of goods, A and B, that require gold and silver. Each unit of type A requires 3 gm of silver and 1 gm of gold while that of type B requires 1 gm of silver and 2 gm of gold. The company can produce 9 gm of silver and 8 gm of gold. If each unit of type A brings a profit of Rs 40 and that of type B Rs 50, find the number of units of each type that the company should produce to maximize the profit. What is the maximum profit?


A manufacturer of Furniture makes two products : chairs and tables. processing of these products is done on two machines A and B. A chair requires 2 hrs on machine A and 6 hrs on machine B. A table requires 4 hrs on machine A and 2 hrs on machine B. There are 16 hrs of time per day available on machine A and 30 hrs on machine B. Profit gained by the manufacturer from a chair and a table is Rs 3 and Rs 5 respectively. Find with the help of graph what should be the daily production of each of the two products so as to maximize his profit.


A firm manufacturing two types of electric items, A and B, can make a profit of Rs 20 per unit of A and Rs 30 per unit of B. Each unit of A requires 3 motors and 4 transformers and each unit of B requires 2 motors and 4 transformers. The total supply of these per month is restricted to 210 motors and 300 transformers. Type B is an export model requiring a voltage stabilizer which has a supply restricted to 65 units per month. Formulate the linear programing problem for maximum profit and solve it graphically.


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 manufacturing company makes two models A and B of a product. Each piece of model A requires 9 labour hours for fabricating and 1 labour hour for finishing.  Each piece of model B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of ₹8000 on each piece of model A and ₹12000 on each piece of model B. How many pieces of model A and model B should be manufactured per week to realise a maximum profit? What is the maximum profit per week?


A manufacturer produces two products 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 ₹7 profit and that of at a profit of ₹4. Find the production level per day for maximum profit graphically.


 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 point at which the maximum value of x + y subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x ≥ 0, y ≥ 0 is obtained, is ______.


A carpenter has 90, 80 and 50 running feet respectively of teak wood, plywood and rosewood which is used to product A and product B. Each unit of product A requires 2, 1 and 1 running feet and each unit of product B requires 1, 2 and 1 running feet of teak wood, plywood and rosewood respectively. If product A is sold for Rs. 48 per unit and product B is sold for Rs. 40 per unit, how many units of product A and product B should be produced and sold by the carpenter, in order to obtain the maximum gross income? Formulate the above as a Linear Programming Problem and solve it, indicating clearly the feasible region in the graph.


Maximum value of 4x + 13y subject to constraints x ≥ 0, y ≥ 0, x + y ≤ 5 and 3x + y ≤ 9 is ______. 


The maximum value of Z = 5x + 4y, Subject to y ≤ 2x, x ≤ 2y, x + y ≤ 3, x ≥ 0, y ≥ 0 is ______.


Maximise and Minimise Z = 3x – 4y subject to x – 2y ≤ 0, – 3x + y ≤ 4, x – y ≤ 6, x, y ≥ 0


Solve the following Linear Programming problem graphically:

Maximize: Z = 3x + 3.5y

Subject to constraints:

x + 2y ≥ 240,

3x + 1.5y ≥ 270,

1.5x + 2y ≤ 310,

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.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×