Advertisements
Advertisements
प्रश्न
Minimize Z = x + 4y subject to constraints
x + 3y ≥ 3, 2x + y ≥ 2, x ≥ 0, y ≥ 0
Advertisements
उत्तर
To draw the feasible region, construct table as follows:
| Inequality | x + 3y ≥ 3 | 2x + y ≥ 2 |
| Corresponding equation (of line) | x + 3y = 3 | 2x + y = 2 |
| Intersection of line with X-axis | (3, 0) | (1, 0) |
| Intersection of line with Y-axis | (0, 1) | (0, 2) |
| Region | Non-origin side | Non-origin side |
Shaded portion XABCY is the feasible region, whose vertices are A(3, 0), B and C(0, 2).
B is the point of intersection of the lines 2x + y = 2 and x + 3y = 3.
∴ B ≡ `(3/5, 4/5)`
Here, the objective function is
Z = x + 4y
∴ Z at A(3, 0) = 3 + 4(0)
= 3
Z at B`(3/5, 4/5) = 3/5 + 4(4/5)`
= `19/5`
= 3.8
Z at C(0, 2) = 0 + 4(2)
= 8
∴ Z has minimum value 3 at x = 3 and y = 0.
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 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.
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 LPP by graphical method:
Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0
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.
Solve the following L.P.P. by graphical method:
Minimize: Z = 6x + 2y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0.
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 :
Graphical solution set of the in equations x ≥ 0, y ≥ 0 is in _______ quadrant
Fill in the blank :
The region represented by the in equations x ≤ 0, y ≤ 0 lines 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
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 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?
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:
If LPP has optimal solution at two point, then
Choose the correct alternative:
The point at which the minimum value of Z = 8x + 12y subject to the constraints 2x + y ≥ 8, x + 2y ≥ 10, x ≥ 0, y ≥ 0 is obtained at the point
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:
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:
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)
A set of values of variables satisfying all the constraints of LPP is known as ______
A company manufactures 2 types of goods P and Q that requires copper and brass. Each unit of type P requires 2 grams of brass and 1 gram of copper while one unit of type Q requires 1 gram of brass and 2 grams of copper. The company has only 90 grams of brass and 80 grams of copper. Each unit of types P and Q brings profit of ₹ 400 and ₹ 500 respectively. Find the number of units of each type the company should produce to maximize its profit
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
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
