हिंदी

A Manufacturer Considers that Men and Women Workers Are Equally Efficient and So He Pays Them at the Same Rate. He Has 30 and 17 Units of Workers (Male and Female) and Capital Respectively,

Advertisements
Advertisements

प्रश्न

A manufacturer considers that men and women workers are equally efficient and so he pays them at the same rate. He has 30 and 17 units of workers (male and female) and capital respectively, which he uses to produce two types of goods A and B. To produce one unit of A, 2 workers and 3 units of capital are required while 3 workers and 1 unit of capital is required to produce one unit of B. If A and B are priced at ₹100 and ₹120 per unit respectively, how should he use his resources to maximise the total revenue? Form the above as an LPP and solve graphically. Do you agree with this view of the manufacturer that men and women workers are equally efficient and so should be paid at the same rate?

योग
Advertisements

उत्तर

Let x units of A and y units of B be produced by the manufacturer.
The price of one unit of A is ₹100 and the price of one unit of B is ₹120. Therefore, the total price of x units of A and y units of B or the total revenue is ₹(100x + 120y).

One unit of A requires 2 workers and one unit of B requires 3 workers. Therefore, xunits of A and y units of B requires (2x + 3y) workers. But, the manufacturer has 30 workers.
∴ 2x + 3y ≤ 30

Similarly, one unit of A requires 3 units of capital and one unit of B requires 1 unit of capital. Therefore, x units of A and y units of B requires (3x + y) units of capital. But, the manufacturer has 17 units of capital.
∴ 3x + y ≤ 17
Thus, the given linear programming problem is
Maximise Z = 100x + 120y
subject to the constraints
2x + 3y ≤ 30
3x + y ≤ 17
x, 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 O(0, 0), A(0, 10), B \[\left( \frac{17}{3}, 0 \right)\]  and C(3, 8). 

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

Corner Point Z = 100x + 120y
(0, 0) 100 × 0 + 120 × 0 = 0
(0, 10)  100 × 0 + 120 × 10 = 1200
 
\[\left( \frac{17}{3}, 0 \right)\]
 100 ×\[\frac{17}{3}\] + 120 × 0 = \[\frac{1700}{3}\]
(3, 8)   100 × 3 + 120 × 8 = 1260   → Maximum
The maximum value of Z is 1260 at x = 3, y = 8.

Hence, the maximum total revenue is ₹1,260 when 3 units of A and 8 units of B are produced.

Yes, because the efficiency of a worker does not depend on whether the worker is a male or a female.
shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 29: Linear programming - Exercise 30.4 [पृष्ठ ५७]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
अध्याय 29 Linear programming
Exercise 30.4 | Q 52 | पृष्ठ ५७

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

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

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?


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:Linear Programming

Minimize Z = 6x + 2y

Subject to

5x + 9y ≤ 90

x + y ≥ 4

y ≤ 8

x ≥ 0, y ≥ 0


In order to supplement daily diet, a person wishes to take X and Y tablets. The contents (in milligrams per tablet) of iron, calcium and vitamins in X and Y are given as below :

Tablets  Iron Calcium Vitamin
x 6 3 2
y 2 3 4

The person needs to supplement at least 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamins. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each type should the person take in order to satisfy the above requirement at the minimum cost? Make an LPP and solve graphically.


Maximise z = 8x + 9y subject to the constraints given below :
2x + 3y ≤ 6
3x − 2y ≤6
y ≤ 1
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\]


Minimize Z = 2x + 4y
Subject to 

\[x + y \geq 8\]
\[x + 4y \geq 12\]
\[x \geq 3, y \geq 2\]

 


Show the solution zone of the following inequalities on a graph paper:

\[5x + y \geq 10\]

\[ x + y \geq 6\]

\[x + 4y \geq 12\]

\[x \geq 0, y \geq 0\]

Find x and y for which 3x + 2y is minimum subject to these inequalities. Use a graphical method.


 Solve the following linear programming problem graphically:
Minimize  z = 6 x + 3 y
Subject to the constraints:

4 x + \[y \geq\] 80
x + 5 \[y \geq\] 115 

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


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 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 contents 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 ₹16 and one kg of food Y costs ₹20. Find the least cost of the mixture which will produce the required diet?

 

A fruit grower can use two types of fertilizer in his garden, brand P and Q. The amounts (in kg) of nirogen, phosphoric acid, potash, and chlorine in a bag of each brand are given in the table. Tests indicates that the garden needs at least 240 kg of phosphoric acid, at least 270 kg of potash and at most 310 kg of chlorine.
 

kg per bag
  Brand P Brand P
Nitrogen 3 3.5
Phosphoric acid 1 2
Potash 3 1.5
Chlorine 1.5 2


If the grower wants to minimize the amount of nitrogen added to the garden, how many bags of each brand should be used? What is the minimum amount of nitrogen added in the garden?


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 manufacturer makes two types A and B of tea-cups. Three machines are needed for the manufacture and the time in minutes required for each cup on the machines is given below:

  Machines
I II III
A
B
12
6
18
0
6
9

Each machine is available for a maximum of 6 hours per day. If the profit on each cup A is 75 paise and that on each cup B is 50 paise, show that 15 tea-cups of type A and 30 of type B should be manufactured in a day to get the maximum profit.


A factory owner purchases two types of machines, A and B, for his factory. The requirements and limitations for the machines are as follows:

  Area occupied by the
machine
Labour force for each
machine
Daily output in
units
Machine A
Machine B
1000 sq. m
1200 sq. m
12 men
8 men
60
40

He has an area of 7600 sq. m available and 72 skilled men who can operate the machines.
How many machines of each type should he buy to maximize the daily output?


A firm manufactures two products A and B. Each product is processed on two machines M1 and M2. Product A requires 4 minutes of processing time on M1 and 8 min. on M2 ; product B requires 4 minutes on M1 and 4 min. on M2. The machine M1 is available for not more than 8 hrs 20 min. while machine M2 is available for 10 hrs. during any working day. The products A and B are sold at a profit of Rs 3 and Rs 4 respectively.
Formulate the problem as a linear programming problem and find how many products of each type should be produced by the firm each day in order to get 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 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 cottage industry manufactures pedestal lamps and wooden shades, each requiring the use of grinding/cutting machine and sprayer. It takes 2 hours on the grinding/cutting machine and 3 hours on the sprayer to manufacture a pedestal lamp while it takes 1 hour on the grinding/cutting machine and 2 hours on the sprayer to manufacture a shade. On any day, the sprayer is available for at most 20 hours and the grinding/cutting machine for at most 12 hours. The profit from the sale of a lamp is ₹5.00 and a shade is ₹3.00. Assuming that the manufacturer sell all the lamps and shades that he produces, how should he schedule his daily production in order to maximise his 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?


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.


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 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?

By graphical method, the solution of linear programming problem

\[\text{Maximize}\text{ Z }= 3 x_1 + 5 x_2 \]
\[\text{ Subject }  to \text{ 3 } x_1 + 2 x_2 \leq 18\]
\[ x_1 \leq 4\]
\[ x_2 \leq 6\]
\[ x_1 \geq 0, x_2 \geq 0, \text{ is } \]

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


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


Area of the region bounded by y = cos x, x = 0, x = π and X-axis is ______ sq.units.


The feasible region of an LPP is shown in the figure. If z = 3x + 9y, then the minimum value of z occurs at ______.


For the LPP, maximize z = x + 4y subject to the constraints x + 2y ≤ 2, x + 2y ≥ 8, x, y ≥ 0 ______.


The minimum value of z = 7x + 9y subject to 3x + y ≤ 6, 5x + 8y ≤ 40, x ≥ 0, y ≥ 2 is ______.


Let R be the feasible region for a linear programming problem, and let Z = ax + by be the objective function. If R is bounded, then ____________.


A manufacturer wishes to produce two commodities A and B. The number of units of material, labour and equipment needed to produce one unit of each commodity is shown in the table given below. Also shown is the available number of units of each item, material, labour, and equipment.

Items Commodity A Commodity B Available no. of Units
Material 1 2 8
Labour 3 2 12
Equipment 1 1 10

Find the maximum profit if each unit of commodity A earns a profit of ₹ 2 and each unit of B earns a profit of ₹ 3.


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


Solve the following Linear Programming Problem graphically:

Maximize: P = 70x + 40y

Subject to: 3x + 2y ≤ 9,

3x + y ≤ 9,

x ≥ 0,y ≥ 0.


Minimize z = x + 2y,

Subject to x + 2y ≥ 50, 2x – y ≤ 0, 2x + y ≤ 100, x ≥ 0, y ≥ 0.


Draw the rough graph and shade the feasible region for the inequalities x + y ≥ 2, 2x + y ≤ 8, x ≥ 0, y ≥ 0.


What is a corner point of a feasible region?


What is the result if no feasible region exists?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×