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.

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

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


A farmer mixes two brands P and Q of cattle feed. Brand P, costing Rs 250 per bag contains 3 units of nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing Rs 200 per bag contains 1.5 units of nutritional elements A, 11.25 units of element B, and 3 units of element C. The minimum requirements of nutrients A, B and C are 18 units, 45 units and 24 units respectively. Determine the number of bags of each brand which should be mixed in order to produce a mixture having a minimum cost per bag? What is the minimum cost of the mixture per bag?


A manufacturer makes two types of toys A and B. Three machines are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:

Type of toy Machines
I II III
A 12 18 6
B 6 0 9

Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A is Rs 7.50 and that on each toy of type B is Rs 5, show that 15 toys of type A and 30 of type B should be manufactured in a day to get maximum profit.

 


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?


The minimum value of the objective function Z = ax + by in a linear programming problem always occurs at only one corner point of the feasible region


Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 2, x ≥ 0, y ≥ 0.


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


The feasible region for a LPP is shown in figure. Evaluate Z = 4x + y at each of the corner points of this region. Find the minimum value of Z, if it exists.


In figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y.


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.


Refer to question 15. Determine the maximum distance that the man can travel.


Refer to Question 27. Maximum of Z occurs at ______.


Refer to Question 27. (Maximum value of Z + Minimum value of Z) is equal to ______.


Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. The Minimum value of F occurs at  ______.


If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax + by may or may not exist.


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


Based on the given shaded region as the feasible region in the graph, at which point(s) is the objective function Z = 3x + 9y maximum?


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:


A linear programming problem is one that is concerned with ____________.


In linear programming infeasible solutions


In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. If M and m respectively be the largest and smallest values at corner points then ____________.


In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case feasible region is unbounded, M is the maximum value of the objective function if ____________.


In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case the feasible region is unbounded, m is the minimum value of the objective function.


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


Z = 6x + 21 y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×