Advertisements
Advertisements
Question
Solve the Linear Programming problem graphically:
Maximize z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0 also find the maximum value of z.
Advertisements
Solution
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 |
x ≥ 0, y ≥ 0 represent 1st quadrant.
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 = 4, y = 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 has maximum value 37 when x = 4, y = 5.
RELATED QUESTIONS
Find the feasible solution of the following inequation:
3x + 4y ≥ 12, 4x + 7y ≤ 28, y ≥ 1, x ≥ 0.
A furniture dealer deals in tables and chairs. He has ₹ 1,50,000 to invest and a space to store at most 60 pieces. A table costs him ₹ 1500 and a chair ₹ 750. Construct the inequations and find the feasible solution.
A doctor has prescribed two different units of foods A and B to form a weekly diet for a sick person. The minimum requirements of fats, carbohydrates and proteins are 18, 28, 14 units respectively. One unit of food A has 4 units of fat, 14 units of carbohydrates and 8 units of protein. One unit of food B has 6 units of fat, 12 units of carbohydrates and 8 units of protein. The price of food A is ₹ 4.5 per unit and that of food B is ₹ 3.5 per unit. Form the LPP, so that the sick person’s diet meets the requirements at a minimum cost.
Solve the following L.P.P. by graphical method:
Minimize: z = 8x + 10y
Subject to: 2x + y ≥ 7, 2x + 3y ≥ 15, y ≥ 2, x ≥ 0, y ≥ 0.
Objective function of LPP is ______.
The maximum value of z = 5x + 3y subject to the constraints 3x + 5y ≤ 15, 5x + 2y ≤ 10, x, y ≥ 0 is ______.
Of all the points of the feasible region, the optimal value of z obtained at the point lies ______.
The half-plane represented by 3x + 2y < 8 contains the point ______.
Solve the following LPP:
Maximize z = 4x + 2y subject to 3x + y ≤ 27, x + y ≤ 21, x ≥ 0, y ≥ 0.
Solve the following LPP:
Maximize z = 6x + 10y subject to 3x + 5y ≤ 10, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0.
Solve each of the following inequations graphically using XY-plane:
4x - 18 ≥ 0
Solve each of the following inequations graphically using XY-plane:
5y - 12 ≥ 0
Solve the following LPP:
Maximize z = 4x1 + 3x2 subject to
3x1 + x2 ≤ 15, 3x1 + 4x2 ≤ 24, x1 ≥ 0, x2 ≥ 0.
Solve the following LPP:
Maximize z =60x + 50y subject to
x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0.
Solve the following LPP:
Minimize z = 4x + 2y
Subject to 3x + y ≥ 27, x + y ≥ 21, x + 2y ≥ 30, x ≥ 0, y ≥ 0
A manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry and then sent to machine shop for finishing. The number of man hours of labour required in each shop for production of A and B and the number of man hours available for the firm are as follows:
| Gadgets | Foundry | Machine Shop |
| A | 10 | 5 |
| B | 6 | 4 |
| Time available (hours) | 60 | 35 |
Profit on the sale of A is ₹ 30 and B is ₹ 20 per unit. Formulate the L.P.P. to have maximum profit.
A printing company prints two types of magazines A and B. The company earns ₹ 10 and ₹ 15 on magazines A and B per copy. These are processed on three machines I, II, III. Magazine A requires 2 hours on Machine I, 5 hours on Machine II and 2 hours on Machine III. Magazine B requires 3 hours on Machine I, 2 hours on Machine II and 6 hours on Machine III. Machines I, II, III are available for 36, 50, 60 hours per week respectively. Formulate the Linear programming problem to maximize the profit.
Solve the following L.P.P. by graphical method:
Maximize: Z = 4x + 6y
Subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
Choose the correct alternative :
Which of the following is correct?
Choose the correct alternative :
Of all the points of the feasible region the optimal value of z is obtained at a point
Choose the correct alternative :
Solution of LPP to minimize z = 2x + 3y st. x ≥ 0, y ≥ 0, 1≤ x + 2y ≤ 10 is
Choose the correct alternative :
The corner points of the feasible region given by the inequations x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0, are
The optimal value of the objective function is attained at the ______ points of the feasible region.
Fill in the blank :
“A gorage employs eight men to work in its shownroom and repair shop. The constraints that there must be at least 3 men in showroom and at least 2 men in repair shop are ______ and _______ respectively.
State whether the following is True or False :
Saina wants to invest at most ₹ 24000 in bonds and fixed deposits. Mathematically this constraints is written as x + y ≤ 24000 where x is investment in bond and y is in fixed deposits.
The feasible region is the set of point which satisfy.
The point of which the maximum value of z = x + y subject to constraints x + 2y ≤ 70, 2x + y ≤ 90, x ≥ 0, y ≥ 0 is obtained at
Maximize z = 5x + 2y subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0
Maximize z = 10x + 25y subject to x + y ≤ 5, 0 ≤ x ≤ 3, 0 ≤ y ≤ 3
Minimize z = 2x + 4y is subjected to 2x + y ≥ 3, x + 2y ≥ 6, x ≥ 0, y ≥ 0 show that the minimum value of z occurs at more than two points
State whether the following statement is True or False:
LPP is related to efficient use of limited resources
The variables involved in LPP are called ______
Solve the following linear programming problems by graphical method.
Maximize Z = 22x1 + 18x2 subject to constraints 960x1 + 640x2 ≤ 15360; x1 + x2 ≤ 20 and x1, x2 ≥ 0.
In the given graph the coordinates of M1 are
The minimum value of the objective function Z = x + 3y subject to the constraints 2x + y ≤ 20, x + 2y ≤ 20, x > 0 and y > 0 is
Given an L.P.P maximize Z = 2x1 + 3x2 subject to the constrains x1 + x2 ≤ 1, 5x1 + 5x2 ≥ 0 and x1 ≥ 0, x2 ≥ 0 using graphical method, we observe
The maximum value of Z = 3x + 5y, subject to 3x + 2y ≤ 18, x ≤ a, y ≤ 6, x, y ≥ 0 is ______.
The LPP to maximize Z = x + y, subject to x + y ≤ 1, 2x + 2y ≥ 6, x ≥ 0, y ≥ 0 has ________.
Solve the following LP.P.
Maximize z = 13x + 9y,
Subject to 3x + 2y ≤ 12,
x + y ≥ 4,
x ≥ 0,
y ≥ 0.
Solution which satisfy all constraints is called ______ solution.
Shamli wants to invest ₹ 50, 000 in saving certificates and PPF. She wants to invest atleast ₹ 15,000 in saving certificates and at least ₹ 20,000 in PPF. The rate of interest on saving certificates is 8% p.a. and that on PPF is 9% p.a. Formulation of the above problem as LPP to determine maximum yearly income, is ______.
Solve the following LPP:
Maximize z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
Food F1 contains 2, 6, 1 units and food F2 contains 1, 1, 3 units of proteins, carbohydrates, fats respectively per kg. 8, 12 and 9 units of proteins, carbohydrates and fats is the weekly minimum requirement for a person. The cost of food F1 is Rs. 85 and food F2 is Rs. 40 per kg. Formulate the L.P.P. to minimize the cost.
Sketch the graph of the following inequation in XOY co-ordinate system.
x + y ≤ 0
