Advertisements
Advertisements
प्रश्न
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.
विकल्प
56
`65
55
66
उत्तर
Z = 10x + 6y
The given inequalities are 3x + y ≤ 12 and 2x + 5y ≤ 34.
Consider line L1 and L2 where
L1 : 3x + y = 12, L2 : 2x + 5y = 34
For line L1, plot A (0, 12) and B (4, 0)
For line L2, plot P (0, 6.8) and Q (17, 0)
Solving both lines, we get x = 2, y = 6.
The coordinates of origin O (0, 0) satisfies both the inequalities.
∴ The required region is on the origin side of both the lines L1 and L2.
As x ≥ 0, y ≥ 0, the feasible region is in the 1st quadrant.
OBRPO is the required feasible region.
At O (0, 0), Z = 0
At B (4, 0), Z = 10 (4) + 0 = 40
At R (2, 6), Z = 10 (2) + 6 (6) = 56
At P (0, 6.8), Z = 0 + 6 (6.8) = 40.8
The maximum value of Z is 56 and it occurs at R (2, 6).
APPEARS IN
संबंधित प्रश्न
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.
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 LPP by graphical method:
Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0
The constraint that a factory has to employ more women (y) than men (x) is given by _______
Graphical solution set of x ≤ 0, y ≥ 0 in xy system lies in second quadrant.
Solve the following problem :
Maximize Z = 4x1 + 3x2 Subject to 3x1 + x2 ≤ 15, 3x1 + 4x2 ≤ 24, x1 ≥ 0, x2 ≥ 0
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 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?
Solve the following problem :
A person makes two types of gift items A and B requiring the services of a cutter and a finisher. Gift item A requires 4 hours of cutter's time and 2 hours of finisher's time. B requires 2 hours of cutters time, 4 hours of finishers time. The cutter and finisher have 208 hours and 152 hours available times respectively every month. The profit of one gift item of type A is ₹ 75 and on gift item B is ₹ 125. Assuming that the person can sell all the items produced, determine how many gift items of each type should be make every month to obtain the best returns?
Choose the correct alternative:
The corner points of the feasible region are (0, 3), (3, 0), (8, 0), `(12/5, 38/5)` and (0, 10), then the point of maximum Z = 6x + 4y = 48 is at
State whether the following statement is True or False:
Corner point method is most suitable method for solving the LPP graphically
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 ______
A chemist has a compound to be made using 3 basic elements X, Y, Z so that it has at least 10 litres of X, 12 litres of Y and 20 litres of Z. He makes this compound by mixing two compounds (I) and (II). Each unit compound (I) had 4 litres of X, 3 litres of Y. Each unit compound (II) had 1 litre of X, 2 litres of Y and 4 litres of Z. The unit costs of compounds (I) and (II) are ₹ 400 and ₹ 600 respectively. Find the number of units of each compound to be produced so as to minimize the cost
Maximize Z = 5x + 10y subject to constraints
x + 2y ≤ 10, 3x + y ≤ 12, x ≥ 0, y ≥ 0
Minimize Z = 24x + 40y subject to constraints
6x + 8y ≥ 96, 7x + 12y ≥ 168, x ≥ 0, y ≥ 0
Minimize Z = 2x + 3y subject to constraints
x + y ≥ 6, 2x + y ≥ 7, x + 4y ≥ 8, x ≥ 0, y ≥ 0
Graphical solution set of the inequations x ≥ 0 and y ≤ 0 lies in ______ quadrant.
