Home
Class 12
MATHS
Two tailors A and B earns 15 and 20 per ...

Two tailors A and B earns 15 and 20 per dayrespectively. A can stitch 6 shirts and 4 paints while Bcan stitch 10 shirts and 4 paints per day. To minimise the cost to stitch 60 shirts and 32 paints, how manydays should they work?

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem of how many days tailors A and B should work to minimize the cost of stitching 60 shirts and 32 pants, we can follow these steps: ### Step 1: Define Variables Let: - \( x \) = number of days tailor A works - \( y \) = number of days tailor B works ### Step 2: Set Up the Production Constraints From the problem: - Tailor A can stitch 6 shirts and 4 pants per day. - Tailor B can stitch 10 shirts and 4 pants per day. Thus, the total production constraints can be formulated as: 1. For shirts: \[ 6x + 10y \geq 60 \] 2. For pants: \[ 4x + 4y \geq 32 \] ### Step 3: Set Up the Cost Function The cost incurred by each tailor per day is: - Tailor A earns \( 15 \) per day. - Tailor B earns \( 20 \) per day. Thus, the total cost function to minimize is: \[ Z = 15x + 20y \] ### Step 4: Formulate the Inequalities We can rewrite the inequalities from the constraints: 1. From \( 6x + 10y \geq 60 \): \[ 6x + 10y = 60 \] 2. From \( 4x + 4y \geq 32 \): \[ 4x + 4y = 32 \] ### Step 5: Find Intercepts for Graphing To graph the equations, we need to find the intercepts. **For the first equation \( 6x + 10y = 60 \)**: - When \( x = 0 \): \[ 10y = 60 \implies y = 6 \quad \text{(Point: (0, 6))} \] - When \( y = 0 \): \[ 6x = 60 \implies x = 10 \quad \text{(Point: (10, 0))} \] **For the second equation \( 4x + 4y = 32 \)**: - When \( x = 0 \): \[ 4y = 32 \implies y = 8 \quad \text{(Point: (0, 8))} \] - When \( y = 0 \): \[ 4x = 32 \implies x = 8 \quad \text{(Point: (8, 0))} \] ### Step 6: Graph the Inequalities Plot the points (0, 6), (10, 0), (0, 8), and (8, 0) on a graph. The feasible region will be bounded by these lines in the first quadrant. ### Step 7: Identify Corner Points The corner points of the feasible region are: 1. (0, 6) 2. (10, 0) 3. (0, 8) 4. (8, 0) 5. Intersection of the two lines. To find the intersection of the lines \( 6x + 10y = 60 \) and \( 4x + 4y = 32 \), we can solve these equations simultaneously. ### Step 8: Solve the System of Equations From \( 4x + 4y = 32 \): \[ x + y = 8 \implies y = 8 - x \] Substituting \( y \) in the first equation: \[ 6x + 10(8 - x) = 60 \] \[ 6x + 80 - 10x = 60 \] \[ -4x + 80 = 60 \implies -4x = -20 \implies x = 5 \] Substituting \( x = 5 \) back to find \( y \): \[ y = 8 - 5 = 3 \] Thus, the intersection point is (5, 3). ### Step 9: Evaluate the Cost Function at Corner Points Now evaluate \( Z = 15x + 20y \) at the corner points: 1. At (0, 6): \[ Z = 15(0) + 20(6) = 120 \] 2. At (10, 0): \[ Z = 15(10) + 20(0) = 150 \] 3. At (5, 3): \[ Z = 15(5) + 20(3) = 75 + 60 = 135 \] 4. At (0, 8): \[ Z = 15(0) + 20(8) = 160 \] 5. At (8, 0): \[ Z = 15(8) + 20(0) = 120 \] ### Step 10: Determine Minimum Cost The minimum cost occurs at the point (5, 3) with \( Z = 135 \). ### Conclusion To minimize the cost of stitching 60 shirts and 32 pants, tailor A should work for **5 days** and tailor B should work for **3 days**.

To solve the problem of how many days tailors A and B should work to minimize the cost of stitching 60 shirts and 32 pants, we can follow these steps: ### Step 1: Define Variables Let: - \( x \) = number of days tailor A works - \( y \) = number of days tailor B works ### Step 2: Set Up the Production Constraints ...
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    NAGEEN PRAKASHAN ENGLISH|Exercise Exercise 12.1|10 Videos
  • LINEAR PROGRAMMING

    NAGEEN PRAKASHAN ENGLISH|Exercise Exercise 12.2|11 Videos
  • LINEAR PROGRAMMING

    NAGEEN PRAKASHAN ENGLISH|Exercise Exercise 12 A|8 Videos
  • INVERES TRIGONOMETRIC FUNCTIONS

    NAGEEN PRAKASHAN ENGLISH|Exercise Miscellaneous Exercise (prove That )|9 Videos
  • MATRICES

    NAGEEN PRAKASHAN ENGLISH|Exercise Miscellaneous Exerice|15 Videos

Similar Questions

Explore conceptually related problems

Two tailors A and B earn Rs. 150 and Rs. 200 per day respectively. A can stich 6 shirts and 4 pants per day, while B can stitch 10 shirts and 4 pants per day. Form a L.P .P to minimize the labour cost to produce (stitch) at least 60 shirts and 32 pants and solve it graphically.

Two tailors, A and B, earn 300 and 400 per day respectively. A can stitch 6 shirts and 4 pairs of trousers while B can stitch 10 shirts and 4 pairs of trousers per day. To find how many days should each of them work and if it is desired to produce at least 60 shirts and 32 pairs of trousers at a minimum labour cost, formulate this as an LPP.

Two tailors A and B earn Rs. 150 and Rs. 200 per day respectively. A can stitch 6 shirts and 4 pants per day while B can stitch 10 shirts and 4 pants per day. Form a linear programming problem to minimize the labour cost to produce at least 60 shirts an 32 pants.

An oil company requires 12,000, 20,000 and 15,000 barrels of high-grade, medium grade and low grade oil, respectively. Refinery A produces 100, 300 and 200 barrels per day of high grade, medium grade and low grade, respectively, while refinery B produces 200,400 and 100 barrels per day of high-grade, medium grade and low grade, respectively. If refinery A costs Rs 400 per day and refinery B costs Rs 300 per day to operate, how many days should each be run to minimize costs while satisfying requirements.

Manufacturer produces two types of steel trunks. He has two machines, A and B. The first type of trunk requires 3 hours on machine A and 3 hours on machine B. The second type 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 per trunk on the first type of trunk and Rs. 25 per trunk on the second type. Formulate a linear programming problem to find out how many trunks of each type he must make each day to maximize his profit.

A manufacturer produces two types of steel trunks. He has tow 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 respectively. How many trunks of each type must he make each day to makes maximum profit?

A rubber company is engaged in producing three types of tyres A, B and C. each type requires processing in two plants, Plant I and Plant II. The capacities of the two plants, in number of tyres per day, are as follows: Plants A B C I 50 100 100 II 60 60 200 The monthly demand for tyre A, B and C is 2500, 3000 and 7000 respectively. If plant I costs Rs. 2500 per day, and plant II costs R. 2500 per day to operate , how many days should each be run per month to minimize cost while meeting the demand? Formulate the problem as LPP.

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 minutes on the automatic and 6 minutes on hand-operated machines to manufacture a packet of screws 'A', while it takes 6 minutes on the automatic and 3 minutes on the hand-operated machines to manufacture a packet of screws 'B'. Each machine is available for at the most 4 hours on any day. The manufacturer can sell a packet of screws 'A' at a profit of 70 paise and screws 'B' at a profit of Rs. 1. Assuming that he can sell all the screws he manufactures, how many packets of each type should the factory owner produce in a day in order to maximise his profit ? Formulate the above L.P.P. and solve it graphically and find the maximum profit.

A factory manufactures two types of screws, A and B. Each type of screw requires the use of two machines, an automatic and a hand operated. It takes 4 minutes on the automatic and 6 minutes on hand operated machines to manufacture a package of screws A, while it takes 6 minutes on automatic and 3 minutes on the hand operated machines to manufacture a package of screws B. Each machine is available for at the most 4 hours on any day. The manufacturer can sell a package of screws A at a profit of 70 paise and screws B at a profit of Rs 1. Assuming that he can sell all the screws he manufactures, how many packages of each type should the factory owner produce in a day in order to maximise his profit? Formulate the above LPP and solve it graphically and determine the maximum profit.

A factory manufactures two types of screws, A and B. Each type of screw requires the use of two machines, an automatic and a hand operated. It takes 4 minutes on the automatic and 6 minutes on hand operated machines to manufacture a package of screws A, while it takes 6 minutes on automatic and 3 minutes on the hand operated machines to manufacture a package of screws B. Each machine is available for at the most 4 hours on any day. The manufacturer can sell a package of screws A at a profit of 70 paise and screws B at a profit of Rs 1. Assuming that he can sell all the screws he manufactures, how many packages of each type should the factory owner produce in a day in order to maximise his profit? Formulate the above LPP and solve it graphically and determine the maximum profit.