मराठी

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
Advertisements

प्रश्न

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

उत्तर १

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

उत्तर २

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
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
2016-2017 (March) All India Set 1

व्हिडिओ ट्यूटोरियलVIEW ALL [2]

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

Solve the following Linear Programming Problems graphically:

Maximise Z = 3x + 4y

subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.


Solve the following Linear Programming Problems graphically:

Minimise Z = – 3x + 4 y

subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0.


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

 


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?


To maintain his health a person must fulfil certain minimum daily requirements for several kinds of nutrients. Assuming that there are only three kinds of nutrients-calcium, protein and calories and the person's diet consists of only two food items, I and II, whose price and nutrient contents are shown in the table below:
 

  Food I
(per lb)
  Food II
(per lb)
    Minimum daily requirement
for the nutrient
 Calcium 10   5     20
Protein 5   4     20
 Calories 2   6     13
 Price (Rs) 60   100      


What combination of two food items will satisfy the daily requirement and entail the least cost? Formulate this as a LPP.


Determine the maximum value of Z = 11x + 7y subject to the constraints : 2x + y ≤ 6, x ≤ 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


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


The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y


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.


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.


The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is Z = 4x + 3y ______.

Compare the quantity in Column A and Column B

Column A Column B
Maximum of Z 325

The feasible solution for a LPP is shown in Figure. Let Z = 3x – 4y be the objective function. Minimum of Z occurs at ______.


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


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


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 ____________.


If two corner points of the feasible region are both optimal solutions of the same type, i.e., both produce the same maximum or minimum.


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 ____________.


Which statement best describes a Linear Programming Problem (LPP)?


In the expression \[Z=250x+75y\], which quantities are the decision variables?


What are constraints in a Linear Programming Problem?


Which statement defines an Optimisation Problem?


Which other constraint must be satisfied together with \[5x+y\leq 100\] in the profit-maximization formulation?


Which set gives the complete non-negative restrictions for the profit-maximization formulation?


Linear Programming is a method of optimisation under which type of constraints?


What are the unknown quantities in a Linear Programming Problem called?


What are restrictions on decision variables called in linear programming?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×