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`
उत्तर २
Let tailor A work for x days and tailor B work for y 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,
6x + 10y ≥ 60
4x + 4y ≥ 32
Further it is given that A and B earn Rs 300 and Rs 400 per day respectively. Thus, in x days and y days, A and B earn Rs 300x and Rs 400y respectively.
Let Z denotes the total cost
∴ Z =Rs (300x + 400y)
Number of days cannot be negative.
Therefore, x, y ≥ 0
Hence, the required LPP is as follows:
Minimize Z = 300x + 400y
subject to
6x + 10y ≥ 60
4x + 4y ≥ 32
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.
Show that the minimum of Z occurs at more than two points.
Minimise and Maximise Z = 5x + 10 y
subject to x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x, y ≥ 0.
Show that the minimum of Z occurs at more than two points.
Maximise Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, 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?
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
Feasible region (shaded) for a LPP is shown in Figure. Maximise Z = 5x + 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 quastion 12. What will be the minimum cost?
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.
Refer to question 15. Determine the maximum distance that the man can travel.
In order to supplement daily diet, a person wishes to take some X and some wishes Y tablets. The contents of iron, calcium and vitamins in X and Y (in milligrams per tablet) are given as below:
| Tablets | Iron | Calcium | Vitamin |
| X | 6 | 3 | 2 |
| Y | 2 | 3 | 4 |
The person needs atleast 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamin. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each should the person take in order to satisfy the above requirement at the minimum cost?
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 = ______.
If the feasible region for a LPP is ______ then the optimal value of the objective function Z = ax + by may or may not exist.
In a LPP if the objective function Z = ax + by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same ______ value.
The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x - 2y ≥ 0, x ≥ 0, y ≥ 0 is ____________.
In linear programming infeasible solutions
In linear programming, optimal solution ____________.
In a LPP, the objective function is always ____________.
The feasible region for an LPP is shown shaded in the following figure. Minimum of Z = 4x + 3y occurs at the point.

Which statement best describes a Linear Programming Problem (LPP)?
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?
