Advertisements
Advertisements
प्रश्न
Maximize Z = 5x + 10y subject to constraints
x + 2y ≤ 10, 3x + y ≤ 12, x ≥ 0, y ≥ 0
Advertisements
उत्तर
To draw the feasible region, construct table as follows:
| Inequality | x + 2y ≤ 10 | 3x + y ≤ 12 |
| Corresponding equation (of line) | x + 2y = 10 | 3x + y = 12 |
| Intersection of line with X-axis | (10, 0) | (4, 0) |
| Intersection of line with Y-axis | (0, 5) | (0, 12) |
| Region | Origin side | Origin side |
Shaded portion OABC is the feasible region, whose vertices are O(0, 0), A(4, 0), B and C(0, 5).
B is the point of intersection of the lines x + 2y = 10 and 3x + y = 12.
Solving the above equations, we get
x = `14/5` y = `18/5`
Here, the objective function is
Z = 5x + 10y
∴ Z at O(0, 0) = 5(0) + 10(0)
= 0
Z at A(4, 0) = 5(4) + 10(0)
= 20
Z at B`(14/5, 18/5) = 5(14/5) + 10(18/5)`
= 14 + 36
= 50
Z at C(0, 5) = 5(0) + 10(5)
= 50
The maximum value of Z is 50 and it occurs at every point lying on the line segment joining B`(14/5, 18/5)` and C(0, 5).
Hence, there are infinitely many optimal solutions.
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 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:
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 maximum value of z = 5x + 3y. subject to the constraints
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
Fill in the blank :
The region represented by the in equations x ≤ 0, y ≤ 0 lines in _______ quadrants.
The region represented by the inequality y ≤ 0 lies in _______ quadrants.
State whether the following is True or False :
The region represented by the inqualities x ≤ 0, y ≤ 0 lies in first quadrant.
Graphical solution set of x ≤ 0, y ≥ 0 in xy system lies in second quadrant.
Solve the following problem :
Minimize Z = 2x + 3y Subject to x – y ≤ 1, x + y ≥ 3, x ≥ 0, y ≥ 0
Maximize Z = 60x + 50y Subject to x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 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 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?
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 corner points of feasible region for the inequations, x + y ≤ 5, x + 2y ≤ 6, x ≥ 0, y ≥ 0 are
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:
Corner point method is most suitable method for solving the LPP graphically
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 ______
If the feasible region is bounded by the inequations 2x + 3y ≤ 12, 2x + y ≤ 8, 0 ≤ x, 0 ≤ y, then point (5, 4) is a ______ of the feasible region
A dealer deals in two products X and Y. He has ₹ 1,00,000/- to invest and space to store 80 pieces. Product X costs ₹ 2500/- and product Y costs ₹ 1000/- per unit. He can sell the items X and Y at respective profits of ₹ 300 and ₹ 90. Construct the LPP and find the number of units of each product to be purchased to maximize its profit
Smita is a diet conscious house wife, wishes to ensure certain minimum intake of vitamins A, B and C for the family. The minimum daily needs of vitamins A, B, and C for the family are 30, 20, and 16 units respectively. For the supply of the minimum vitamin requirements Smita relies on 2 types of foods F1 and F2. F1 provides 7, 5 and 2 units of A, B, C vitamins per 10 grams and F2 provides 2, 4 and 8 units of A, B and C vitamins per 10 grams. F1 costs ₹ 3 and F2 costs ₹ 2 per 10 grams. How many grams of each F1 and F2 should buy every day to keep her food bill minimum
Solve the following LPP graphically:
Maximize Z = 9x + 13y subject to constraints
2x + 3y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0
Solution: Convert the constraints into equations and find the intercept made by each one of it.
| Inequation | Equation | X intercept | Y intercept | Region |
| 2x + 3y ≤ 18 | 2x + 3y = 18 | (9, 0) | (0, ___) | Towards origin |
| 2x + y ≤ 10 | 2x + y = 10 | ( ___, 0) | (0, 10) | Towards origin |
| x ≥ 0, y ≥ 0 | x = 0, y = 0 | X axis | Y axis | ______ |
The feasible region is OAPC, where O(0, 0), A(0, 6),
P( ___, ___ ), C(5, 0)
The optimal solution is in the following table:
| Point | Coordinates | Z = 9x + 13y | Values | Remark |
| O | (0, 0) | 9(0) + 13(0) | 0 | |
| A | (0, 6) | 9(0) + 13(6) | ______ | |
| P | ( ___,___ ) | 9( ___ ) + 13( ___ ) | ______ | ______ |
| C | (5, 0) | 9(5) + 13(0) | ______ |
∴ Z is maximum at __( ___, ___ ) with the value ___.
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 ___
Maximised value of z in z = 3x + 4y, subject to constraints : x + y ≤ 4, x ≥ 0. y ≥ 0
Graphical solution set of the inequations x ≥ 0 and y ≤ 0 lies in ______ quadrant.
