Advertisements
Advertisements
प्रश्न
Solve the following L.P.P. by graphical method :
Maximize: Z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0 also find maximum value of Z.
Advertisements
उत्तर
To draw the feasible region, construct table as follows:
| Inequality | x + 4y ≤ 24 | 3x + y ≤ 21 | x + y ≤ 9 |
| Corresponding equation (of line) | x + 4y = 24 | 3x + y = 21 | x + y = 9 |
| Intersection of line with X-axis | (24, 0) | (7, 0) | (9, 0) |
| Intersection of line with Y-axis | (0, 6) | (0, 21) | (0, 9) |
| Region | Origin side | Origin side | Origin side |
Shaded portion OABCD is the feasible region,
whose vertices are O (0, 0), A (7, 0), B, C and D (0, 6)
B is the point of intersection of the lines 3x + y = 21 and x + y = 9.
Solving the above equations, we get
x = 6, y = 3
∴ B ≡ (6, 3)
C is the point of intersection of the lines x + 4y = 24
and x + y = 9.
Solving the above equations, we get
x = 4y = 5
∴ C ≡ (4, 5)
Here, the objective function is
Z = 3x + 5y
∴ Z at O(0, 0) = 3(0) + 5(0) = 0
Z at A(7, 0) = 3(7) + 5(0) = 21
Z at B(6, 3) = 3(6) + 5(3)
= 18 + 15 = 33
Z at C(4, 5) = 3(4) + 5(5)
= 12 + 25 = 37
Z at D(0, 6) = 3(0) + 5(6) = 30
∴ Z has maximum value 37 at C(4, 5).
∴ Z is maximum, when x = 4, y = 5.
APPEARS IN
संबंधित प्रश्न
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.
The corner points of the feasible region determined by the following system of linear inequalities:
2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let Z = px + qy, where p, q > 0. Condition on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is
A firm manufactures two products, each of which must be processed through two departments, 1 and 2. The hourly requirements per unit for each product in each department, the weekly capacities in each department, selling price per unit, labour cost per unit, and raw material cost per unit are summarized as follows:
| Product A | Product B | Weekly capacity | |
| Department 1 | 3 | 2 | 130 |
| Department 2 | 4 | 6 | 260 |
| Selling price per unit | ₹ 25 | ₹ 30 | |
| Labour cost per unit | ₹ 16 | ₹ 20 | |
| Raw material cost per unit | ₹ 4 | ₹ 4 |
The problem is to determine the number of units to produce each product so as to maximize total contribution to profit. Formulate this as a LPP.
Solve the following L.P.P. by graphical method:
Maximize: Z = 10x + 25y
subject to 0 ≤ x ≤ 3,
0 ≤ y ≤ 3,
x + y ≤ 5.
Also find the maximum value of z.
Choose the correct alternative:
The value of objective function is maximize under linear constraints.
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
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.
Solve the following problem :
A company manufactures bicyles and tricycles, each of which must be processed through two machines A and B Maximum availability of machine A and B is respectively 120 and 180 hours. Manufacturing a bicycle requires 6 hours on machine A and 3 hours on machine B. Manufacturing a tricycle requires 4 hours on machine A and 10 hours on machine B. If profits are ₹ 180 for a bicycle and ₹ 220 on a tricycle, determine the number of bicycles and tricycles that should be manufacturing in order to maximize the profit.
Solve the following problem :
A firm manufacturing two types of electrical items A and B, can make a profit of ₹ 20 per unit of A and ₹ 30 per unit of B. Both A and B make use of two essential components, a motor and a transformer. Each unit of A requires 3 motors and 2 transformers and each unit of B requires 2 motors and 4 transformers. The total supply of components per month is restricted to 210 motors and 300 transformers. How many units of A and B should be manufacture per month to maximize profit? How much is the maximum profit?
Choose the correct alternative:
The minimum value of Z = 4x + 5y subjected to the constraints x + y ≥ 6, 5x + y ≥ 10, x, y ≥ 0 is
Choose the correct alternative:
The corner points of the feasible region are (4, 2), (5, 0), (4, 1) and (6, 0), then the point of minimum Z = 3.5x + 2y = 16 is at
State whether the following statement is True or False:
The maximum value of Z = 5x + 3y subjected to constraints 3x + y ≤ 12, 2x + 3y ≤ 18, 0 ≤ x, y is 20
State whether the following statement is True or False:
If the corner points of the feasible region are `(0, 7/3)`, (2, 1), (3, 0) and (0, 0), then the maximum value of Z = 4x + 5y is 12
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
A set of values of variables satisfying all the constraints of LPP is known as ______
Minimize Z = 24x + 40y subject to constraints
6x + 8y ≥ 96, 7x + 12y ≥ 168, x ≥ 0, y ≥ 0
Minimize Z = x + 4y subject to constraints
x + 3y ≥ 3, 2x + y ≥ 2, x ≥ 0, y ≥ 0
Minimize Z = 2x + 3y subject to constraints
x + y ≥ 6, 2x + y ≥ 7, x + 4y ≥ 8, x ≥ 0, y ≥ 0
Amartya wants to invest ₹ 45,000 in Indira Vikas Patra (IVP) and in Public Provident fund (PPF). He wants to invest at least ₹ 10,000 in PPF and at least ₹ 5000 in IVP. If the rate of interest on PPF is 8% per annum and that on IVP is 7% per annum. Formulate the above problem as LPP to determine maximum yearly income.
Solution: Let x be the amount (in ₹) invested in IVP and y be the amount (in ₹) invested in PPF.
x ≥ 0, y ≥ 0
As per the given condition, x + y ______ 45000
He wants to invest at least ₹ 10,000 in PPF.
∴ y ______ 10000
Amartya wants to invest at least ₹ 5000 in IVP.
∴ x ______ 5000
Total interest (Z) = ______
The formulated LPP is
Maximize Z = ______ subject to
______
