English

Two Tailors, a and B, Earn Rs 300 and Rs 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 - Mathematics

Advertisements
Advertisements

Question

Two tailors, A and B, earn Rs 300 and Rs 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

Advertisements

Solution 1

Tailors/Product A(x) B(y) Avl
Shirts 6 10 60
Trousers 4 4 32

Let A work x days and B work y days.

`∴ x >= 0, y >= 0`

So L.P.P., objective function Min. Z = 300 x + 400 y

Subject to.
`6x + 10y >= 60`

`4x + 4y >= 32` 

:. LPP

Min. Z = 300 x + 400 y

Subject to.

`3x + 5y >= 30`

`x + y >= 8`

`x >= 0, y >= 0`

shaalaa.com

Solution 2

Let tailor A work for days and tailor B work for days.

In one day, A can stitch 6 shirts and 4 pairs of trousers whereas B can stitch 10 shirts and 4 pairs of trousers.

Thus, in x days A can stitch 6x shirts and 4x pairs of trousers. Similarly, in y days B can stitch 10y shirts and 4y pairs of trousers.

It is given that the minimum requirement of the shirts and pairs of trousers are respectively 60 and 32 respectively.

Thus,

610≥ 60

44≥ 32

Further it is given that A and B earn Rs 300 and Rs 400 per day respectively. Thus, in x days and days, A and B earn Rs 300x and Rs 400y  respectively.

Let Z denotes the total cost

∴ Z =Rs (300400y)

Number of days cannot be negative.

Therefore, x, y ≥ 0

Hence, the required LPP is as follows:

Minimize  300400y

subject to

610≥ 60

44≥ 32

≥ 0, ≥ 0

shaalaa.com
  Is there an error in this question or solution?
2016-2017 (March) All India Set 1

RELATED QUESTIONS

Show that the minimum of Z occurs at more than two points.

Minimise and Maximise Z = x + 2y 

subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.


Show that the minimum of Z occurs at more than two points.

Maximise Z = – x + 2y, Subject to the constraints:

x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.


An aeroplane can carry a maximum of 200 passengers. A profit of Rs 1000 is made on each executive class ticket and a profit of Rs 600 is made on each economy class ticket. The airline reserves at least 20 seats for executive class. However, at least 4 times as many passengers prefer to travel by economy class than by the executive class. Determine how many tickets of each type must be sold in order to maximize the profit for the airline. What is the maximum 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.


Minimise Z = 13x – 15y subject to the constraints: x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥ 0, y ≥ 0


Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown in Figure


Feasible region (shaded) for a LPP is shown in Figure. Maximise Z = 5x + 7y.


A man rides his motorcycle at the speed of 50 km/hour. He has to spend Rs 2 per km on petrol. If he rides it at a faster speed of 80 km/hour, the petrol cost increases to Rs 3 per km. He has atmost Rs 120 to spend on petrol and one hour’s time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem


Refer to question 13. Solve the linear programming problem and determine the maximum profit to the manufacturer


Refer to question 14. How many sweaters of each type should the company make in a day to get a maximum profit? What is the maximum profit.


A manufacturer produces two Models of bikes-Model X and Model Y. Model X takes a 6 man-hours to make per unit, while Model Y takes 10 man-hours per unit. There is a total of 450 man-hour available per week. Handling and Marketing costs are Rs 2000 and Rs 1000 per unit for Models X and Y respectively. The total funds available for these purposes are Rs 80,000 per week. Profits per unit for Models X and Y are Rs 1000 and Rs 500, respectively. How many bikes of each model should the manufacturer produce so as to yield a maximum profit? Find the maximum profit.


Refer to Question 30. Minimum value of F is ______.


Refer to Question 32, Maximum of F – Minimum of F = ______.


In a LPP, the linear inequalities or restrictions on the variables are called ____________.


In a LPP, the objective function is always ______.


If the feasible region for a LPP is ______ then the optimal value of the objective function Z = ax + by may or may not exist.


Maximum value of the objective function Z = ax + by in a LPP always occurs at only one corner point of the feasible region.


In a LPP, the maximum value of the objective function Z = ax + by is always finite.


A linear programming problem is as follows:

Minimize Z = 30x + 50y

Subject to the constraints: 3x + 5y ≥ 15, 2x + 3y ≤ 18, x ≥ 0, y ≥ 0

In the feasible region, the minimum value of Z occurs at:


For an objective function Z = ax + by, where a, b > 0; the corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 20), (10, 10), (30, 30) and (0, 40). The condition on a and b such that the maximum Z occurs at both the points (30, 30) and (0, 40) is:


In a linear programming problem, the constraints on the decision variables x and y are x − 3y ≥ 0, y ≥ 0, 0 ≤ x ≤ 3. The feasible region:


In a LPP, the objective function is always ____________.


Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.


Maximize Z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.


The feasible region for an LPP is shown shaded in the figure. Let Z = 3x - 4y be the objective function. Minimum of Z occurs at ____________.


The feasible region for an LPP is shown shaded in the following figure. Minimum of Z = 4x + 3y occurs at the point.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×