Advertisements
Advertisements
प्रश्न
A carpenter makes chairs and tables, profits are ₹ 140 per chair and ₹ 210 per table. Both products are processed on three machines, Assembling, Finishing and Polishing. The time required for each product in hours and the availability of each machine is given by the following table.
| Product/Machines | Chair (x) |
Table (y) |
Available time (hours) |
| Assembling | 3 | 3 | 36 |
| Finishing | 5 | 2 | 50 |
| Polishing | 2 | 6 | 60 |
Formulate and solve the following Linear programming problems using graphical method.
Advertisements
उत्तर
Let x be the number of chairs and y be the number of tables.
∴ The constraints are
3x + 3y ≤ 36
5x + 2y ≤ 50
2x + 6y ≤ 60
Since x and y are the numbers of chairs and tables, respectively.
∴ They cannot be negative.
∴ x ≥ 0, y ≥ 0
Now, the profit for one chair is ₹ 140 and the profit for one table is ₹ 210
∴ Total profit (Z) = 140x + 210y
This is an objective function to be maximized
∴ The given problem can be formulated as
Maximize Z = 140x + 210y
Subject to 3x + 3y ≤ 36
5x + 2y ≤ 50
2x + 6y ≤ 60
x ≥ 0, y ≥ 0
To find the graphical solution, construct the table as follows:
| Inequation | Equation | Double intercept form | Points (x, y) | Region |
| 3x + 3y ≤ 36 | 3x + 3y = 36 | `x/(2) + y/(12)` = 1 | A (12, 0) B (0, 12) |
3(0) + 3(0) ≤ 36 ∴ (0) ≤ 36 ∴ Origin-side |
| 5x + 2y ≤ 50 | 5x + 2y = 50 | `x/(10) + y/(25)` = 1 | C 10, 0) D (0, 25) |
5(0) + 2(0) ≤ 50 ∴ 0 ≤ 50 ∴ Origin-side |
| 2x + 6y ≤60 | 2x + 6y = 60 | `x/(30) + y/(10)` = 1 | E (30, 0) F (0, 10 |
2(0) + 6(0) ≤ 60 ∴ 0 ≤ 60 ∴ Origin-side |
| x ≥ 0 | x = 0 | – | – | R.H.S. of Y-axis |
| y ≥ 0 | y = 0 | – | – | above X-axis |
The shaded portion OFG HC is the feasible region,
Whose vertices are O (0, 0), F (0, 10), G, H and C (10, 0)
G is the point of intersection of lines.
2x + 6y = 60
i.e., x + 3y = 30 …(i)
and 3x + 3y = 36
i.e., x + y = 12 …(ii)
∴ By (i) – (ii), we get
x + 3y = 30
x + y = 12
– – –
2y = 18
∴ y = 9
Substituting y = 9 in (ii), we get
x + 9 = 12
∴ x = 12 – 9
∴ x = 3
∴ G = (3, 9)
H is the point of intersection of lines.
3x + 3y = 36
i.e., x + y = 12 …(ii)
5x + 2y = 50 …(iii)
∴ By 2 x (ii) – (iii), we get
2x + 2y = 24
5x + 2y = 50
– – –
– 3x – 26
∴ x = `(26)/(3)`
Substituting x = `(26)/(3)` in (ii), we get
`(26)/(3) + y` = 12
∴ y = `12 - (26)/(3) = (36 - 26)/(3)`
∴ y = `(10)/(3)`
∴ H`(26/3, 10/3)`
Here, the objective function is Z = 140x + 210y
Now, we will find the maximum value of Z as follows:
| Feasible Points | The value of Z = 140x + 210y |
| O (0, 0) | Z = 140(0) + 210(0) = 0 |
| F (0, 10) | Z = 140(0) + 210(10) = 2100 |
| G (3, 9) | Z = 140(3) + 210(9) = 420 + 1890 = 2310 |
| H`(36/3, 10/3)` | Z = `140(26/3) + 210(10/3) = (3640)/(3) + (2100)/(3)` = 1913.33 |
| C (10, 0) | Z = 140(10) + 210(0) = 1400 |
∴ Z has a maximum value of 2310 at G (3, 9)
∴ Maximum profit is ₹ 2310, when x = number of chairs = 3, y = number of tables = 9.
APPEARS IN
संबंधित प्रश्न
The postmaster of a local post office wishes to hire extra helpers during the Deepawali season, because of a large increase in the volume of mail handling and delivery. Because of the limited office space and the budgetary conditions, the number of temporary helpers must not exceed 10. According to past experience, a man can handle 300 letters and 80 packages per day, on the average, and a woman can handle 400 letters and 50 packets per day. The postmaster believes that the daily volume of extra mail and packages will be no less than 3400 and 680 respectively. A man receives Rs 225 a day and a woman receives Rs 200 a day. How many men and women helpers should be hired to keep the pay-roll at a minimum ? Formulate an LPP and solve it graphically.
A company produces two types of goods A and B, that require gold and silver. Each unit of type A requires 3 g of silver and 1 g of golds while that of type B requires 1 g of silver and 2 g of gold. The company can procure a maximum of 9 g of silver and 8 g of gold. If each unit of type A brings a profit of Rs 40 and that of type B Rs 50, formulate LPP to maximize profit.
A firm manufactures 3 products A, B and C. The profits are Rs 3, Rs 2 and Rs 4 respectively. The firm has 2 machines and below is the required processing time in minutes for each machine on each product :
| Machine | Products | ||
| A | B | C | |
| M1 M2 |
4 | 3 | 5 |
| 2 | 2 | 4 | |
Machines M1 and M2 have 2000 and 2500 machine minutes respectively. The firm must manufacture 100 A's, 200 B's and 50 C's but not more than 150 A's. Set up a LPP to maximize the profit.
Amit's mathematics teacher has given him three very long lists of problems with the instruction to submit not more than 100 of them (correctly solved) for credit. The problem in the first set are worth 5 points each, those in the second set are worth 4 points each, and those in the third set are worth 6 points each. Amit knows from experience that he requires on the average 3 minutes to solve a 5 point problem, 2 minutes to solve a 4 point problem, and 4 minutes to solve a 6 point problem. Because he has other subjects to worry about, he can not afford to devote more than
A farmer has a 100 acre farm. He can sell the tomatoes, lettuce, or radishes he can raise. The price he can obtain is Rs 1 per kilogram for tomatoes, Rs 0.75 a head for lettuce and Rs 2 per kilogram for radishes. The average yield per acre is 2000 kgs for radishes, 3000 heads of lettuce and 1000 kilograms of radishes. Fertilizer is available at Rs 0.50 per kg and the amount required per acre is 100 kgs each for tomatoes and lettuce and 50 kilograms for radishes. Labour required for sowing, cultivating and harvesting per acre is 5 man-days for tomatoes and radishes and 6 man-days for lettuce. A total of 400 man-days of labour are available at Rs 20 per man-day. Formulate this problem as a LPP to maximize the farmer's total profit.
Solve the following L.P.P. by graphical method :
Minimize : Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.
Choose the correct alternative :
The maximum value of z = 10x + 6y, subjected to the constraints 3x + y ≤ 12, 2x + 5y ≤ 34, x ≥ 0, y ≥ 0 is.
Choose the correct alternative :
The point at which the maximum value of z = x + y subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x ≥ 0, y ≥ 0 is
The region represented by the inequality y ≤ 0 lies in _______ quadrants.
Graphical solution set of x ≤ 0, y ≥ 0 in xy system lies in second quadrant.
Solve the following problem :
Maximize Z = 5x1 + 6x2 Subject to 2x1 + 3x2 ≤ 18, 2x1 + x2 ≤ 12, x ≥ 0, x2 ≥ 0
Solve the following problem :
Minimize Z = 2x + 3y Subject to x – y ≤ 1, x + y ≥ 3, x ≥ 0, y ≥ 0
Solve the following problem:
Maximize Z = 4x1 + 3x2 Subject to 3x1 + x2 ≤ 15, 3x1 + 4x2 ≤ 24, x1 ≥ 0, x2 ≥ 0
Solve the following problem :
A factory produced two types of chemicals A and B The following table gives the units of ingredients P & Q (per kg) of Chemicals A and B as well as minimum requirements of P and Q and also cost per kg. of chemicals A and B.
| Ingredients per kg. /Chemical Units | A (x) |
B (y) |
Minimum requirements in |
| P | 1 | 2 | 80 |
| Q | 3 | 1 | 75 |
| Cost (in ₹) | 4 | 6 |
Find the number of units of chemicals A and B should be produced so as to minimize the cost.
Solve the following problem :
A Company produces mixers and processors Profit on selling one mixer and one food processor is ₹ 2000 and ₹ 3000 respectively. Both the products are processed through three machines A, B, C The time required in hours by each product and total time available in hours per week on each machine are as follows:
| Machine/Product | Mixer per unit | Food processor per unit | Available time |
| A | 3 | 3 | 36 |
| B | 5 | 2 | 50 |
| C | 2 | 6 | 60 |
How many mixers and food processors should be produced to maximize the profit?
State whether the following statement is True or False:
If the corner points of the feasible region are (0, 10), (2, 2) and (4, 0), then the minimum value of Z = 3x + 2y is at (4, 0)
State whether the following statement is True or False:
Of all the points of feasible region, the optimal value is obtained at the boundary of the feasible region
State whether the following statement is True or False:
The graphical solution set of the inequations 0 ≤ y, x ≥ 0 lies in second quadrant
A set of values of variables satisfying all the constraints of LPP is known as ______
Maximize Z = 2x + 3y subject to constraints
x + 4y ≤ 8, 3x + 2y ≤ 14, x ≥ 0, y ≥ 0.
Maximize Z = 400x + 500y subject to constraints
x + 2y ≤ 80, 2x + y ≤ 90, x ≥ 0, y ≥ 0
Minimize Z = 24x + 40y subject to constraints
6x + 8y ≥ 96, 7x + 12y ≥ 168, x ≥ 0, y ≥ 0
Solve the LPP graphically:
Minimize Z = 4x + 5y
Subject to the constraints 5x + y ≥ 10, x + y ≥ 6, x + 4y ≥ 12, x, y ≥ 0
Solution: Convert the constraints into equations and find the intercept made by each one of it.
| Inequations | Equations | X intercept | Y intercept | Region |
| 5x + y ≥ 10 | 5x + y = 10 | ( ___, 0) | (0, 10) | Away from origin |
| x + y ≥ 6 | x + y = 6 | (6, 0) | (0, ___ ) | Away from origin |
| x + 4y ≥ 12 | x + 4y = 12 | (12, 0) | (0, 3) | Away from origin |
| x, y ≥ 0 | x = 0, y = 0 | x = 0 | y = 0 | 1st quadrant |
∵ Origin has not satisfied the inequations.
∴ Solution of the inequations is away from origin.
The feasible region is unbounded area which is satisfied by all constraints.
In the figure, ABCD represents
The set of the feasible solution where
A(12, 0), B( ___, ___ ), C ( ___, ___ ) and D(0, 10).
The coordinates of B are obtained by solving equations
x + 4y = 12 and x + y = 6
The coordinates of C are obtained by solving equations
5x + y = 10 and x + y = 6
Hence the optimum solution lies at the extreme points.
The optimal solution is in the following table:
| Point | Coordinates | Z = 4x + 5y | Values | Remark |
| A | (12, 0) | 4(12) + 5(0) | 48 | |
| B | ( ___, ___ ) | 4( ___) + 5(___ ) | ______ | ______ |
| C | ( ___, ___ ) | 4( ___) + 5(___ ) | ______ | |
| D | (0, 10) | 4(0) + 5(10) | 50 |
∴ Z is minimum at ___ ( ___, ___ ) with the value ___
A linear function z = ax + by, where a and b are constants, which has to be maximised or minimised according to a set of given condition is called a:-
Maximised value of z in z = 3x + 4y, subject to constraints : x + y ≤ 4, x ≥ 0. y ≥ 0
