Advertisements
Advertisements
Question
Maximize Z = 4x + 3y
Subject to
\[3x + 4y \leq 24\]
\[8x + 6y \leq 48\]
\[ x \leq 5\]
\[ y \leq 6\]
\[ x, y \geq 0\]
Advertisements
Solution
We need to maximize Z = 4x + 3y
First, we will convert the given inequations into equations, we obtain the following equations:
3x + 4y = 24, 8x + 6y = 48, x = 5 , y = 6, x = 0 and y = 0.
The line 3x + 4y = 24 meets the coordinate axis at A(8, 0) and B(0,6). Join these points to obtain the line 3x + 4y = 24.
Clearly, (0, 0) satisfies the inequation 3x + 4y ≤ 24.So, the region in xy-plane that contains the origin represents the solution set of the given equation.
The line 8x + 6y = 48 meets the coordinate axis at C(6, 0) and D(0,8). Join these points to obtain the line 8x + 6y = 48.
Clearly, (0, 0) satisfies the inequation 8x + 6y ≤ 48. So, the region in xy-plane that contains the origin represents the solution set of the given equation.
x = 5 is the line passing through x = 5 parallel to the Y axis.
y = 6 is the line passing through y = 6 parallel to the X axis.
Region represented by x ≥ 0 and y ≥ 0:
Since, every point in the first quadrant satisfies these inequations. So, the first quadrant is the region represented by the inequations.
These lines are drawn using a suitable scale.
The corner points of the feasible region are O(0, 0), \[G\left( 5, 0 \right)\], \[F\left( 5, \frac{4}{3} \right)\] , \[E\left( \frac{24}{7}, \frac{24}{7} \right)\] and \[B\left( 0, 6 \right)\] The values of Z at these corner points are as follows.
| Corner point | Z = 4x + 3y | |
| O(0, 0) | 4× 0 + 3 × 0 = 0 | |
|
\[G\left( 5, 0 \right)\]
|
4 × 5 + 3 × 0 = 20 | |
|
\[F\left( 5, \frac{4}{3} \right)\]
|
4 × 5 + 3 × \[\frac{4}{3}\] = 24
|
|
|
\[E\left( \frac{24}{7}, \frac{24}{7} \right)\]
|
4 × \[\frac{24}{7}\]+3 x \[\frac{24}{7}\]= \[\frac{196}{7}\] = 24 | |
|
\[B\left( 0, 6 \right)\]
|
|
We see that the maximum value of the objective function Z is 24 which is at \[F\left( 5, \frac{4}{3} \right)\] \[E\left( \frac{24}{7}, \frac{24}{7} \right)\] Thus, the optimal value of Z is 24.
APPEARS IN
RELATED QUESTIONS
Minimum and maximum z = 5x + 2y subject to the following constraints:
x-2y ≤ 2
3x+2y ≤ 12
-3x+2y ≤ 3
x ≥ 0,y ≥ 0
Solve the following L.P.P. graphically Maximise Z = 4x + y
Subject to following constraints x + y ≤ 50
3x + y ≤ 90,
x ≥ 10
x, y ≥ 0
Minimize Z = 5x + 3y
Subject to
\[2x + y \geq 10\]
\[x + 3y \geq 15\]
\[ x \leq 10\]
\[ y \leq 8\]
\[ x, y \geq 0\]
Maximize Z = 2x + 3y
Subject to
\[x + y \geq 1\]
\[10x + y \geq 5\]
\[x + 10y \geq 1\]
\[ x, y \geq 0\]
Maximize Z = 3x1 + 4x2, if possible,
Subject to the constraints
\[x_1 - x_2 \leq - 1\]
\[ - x_1 + x_2 \leq 0\]
\[ x_1 , x_2 \geq 0\]
Reshma wishes to mix two types of food P and Q in such a way that the vitamin contents of the mixture contains at least 8 units of vitamin A and 11 units of vitamin B. Food P costs ₹60/kg and food Q costs ₹80/kg. Food P contains 3 units/kg of vitamin A and 5 units/kg of vitamin B while food Q contains 4 units/kg of vitamin A and 2 units/kg of vitamin B. Determine the minimum cost of the mixture.
A dietician has to develop a special diet using two foods P and Q. Each packet (containing 30 g) of food P contains 12 units of calcium, 4 units of iron, 6 units of cholesterol and 6 units of vitamin A. Each packet of the same quantity of food Q contains 3 units of calcium, 20 units of iron, 4 units of cholesterol and 3 units of vitamin A. The diet requires atleast 240 units of calcium, atleast 460 units of iron and at most 300 units of cholesterol. How many packets of each food should be used to minimise the amount of vitamin A in the diet? What is the minimum of vitamin A.
If a young man drives his vehicle at 25 km/hr, he has to spend Rs 2 per km on petrol. If he drives it at a faster speed of 40 km/hr, the petrol cost increases to Rs 5/per km. He has Rs 100 to spend on petrol and travel within one hour. Express this as an LPP and solve the same.
Two tailors, A and B earn Rs 15 and Rs 20 per day respectively. A can stitch 6 shirts and 4 pants while B can stitch 10 shirts and 4 pants per day. How many days shall each work if it is desired to produce (at least) 60 shirts and 32 pants at a minimum labour cost?
A firm manufactures two products A and B. Each product is processed on two machines M1 and M2. Product A requires 4 minutes of processing time on M1 and 8 min. on M2 ; product B requires 4 minutes on M1 and 4 min. on M2. The machine M1 is available for not more than 8 hrs 20 min. while machine M2 is available for 10 hrs. during any working day. The products A and B are sold at a profit of Rs 3 and Rs 4 respectively.
Formulate the problem as a linear programming problem and find how many products of each type should be produced by the firm each day in order to get maximum profit.
A firm manufactures headache pills in two sizes A and B. Size A contains 2 grains of aspirin, 5 grains of bicarbonate and 1 grain of codeine; size B contains 1 grain of aspirin, 8 grains of bicarbonate and 66 grains of codeine. It has been found by users that it requires at least 12 grains of aspirin, 7.4 grains of bicarbonate and 24 grains of codeine for providing immediate effects. Determine graphically the least number of pills a patient should have to get immediate relief. Determine also the quantity of codeine consumed by patient.
A manufacturer makes two products A and B. Product A sells at Rs 200 each and takes 1/2 hour to make. Product B sells at Rs 300 each and takes 1 hour to make. There is a permanent order for 14 of product A and 16 of product B. A working week consists of 40 hours of production and weekly turnover must not be less than Rs 10000. If the profit on each of product A is Rs 20 and on product B is Rs 30, then how many of each should be produced so that the profit is maximum. Also, find the maximum profit.
A manufacturer produces two types of steel trunks. He has two machines A and B. For completing, the first types of the trunk requires 3 hours on machine A and 3 hours on machine B, whereas the second type of the trunk requires 3 hours on machine A and 2 hours on machine B. Machines A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of Rs 30 and Rs 25 per trunk of the first type and the second type respectively. How many trunks of each type must he make each day to make maximum profit?
A manufacturer of patent medicines is preparing a production plan on medicines, A and B. There are sufficient raw materials available to make 20000 bottles of A and 40000 bottles of B, but there are only 45000 bottles into which either of the medicines can be put. Further, it takes 3 hours to prepare enough material to fill 1000 bottles of A, it takes 1 hour to prepare enough material to fill 1000 bottles of B and there are 66 hours available for this operation. The profit is Rs 8 per bottle for A and Rs 7 per bottle for B. How should the manufacturer schedule his production in order to maximize his profit?
A manufacturing company makes two models A and B of a product. Each piece of model A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each piece of model B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of ₹8000 on each piece of model A and ₹12000 on each piece of model B. How many pieces of model A and model B should be manufactured per week to realise a maximum profit? What is the maximum profit per week?
A manufacturer makes two types of toys A and B. Three machines are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:
| Types of Toys | Machines | ||
| I | II | III | |
| A | 12 | 18 | 6 |
| B | 6 | 0 | 9 |
There are two types of fertilisers 'A' and 'B' . 'A' consists of 12% nitrogen and 5% phosphoric acid whereas 'B' consists of 4% nitrogen and 5% phosphoric acid. After testing the soil conditions, farmer finds that he needs at least 12 kg of nitrogen and 12 kg of phosphoric acid for his crops. If 'A' costs ₹10 per kg and 'B' cost ₹8 per kg, then graphically determine how much of each type of fertiliser should be used so that nutrient requiremnets are met at a minimum cost
The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is
A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type A
require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours and 20 minutes available for cutting and 4 hours available for assembling. The profit is Rs. 50 each for type A and Rs. 60 each for type B souvenirs. How many souvenirs of each type should the company manufacture in order to maximize profit? Formulate the above LPP and solve it graphically and also find the maximum profit.
The graph of the inequality 3X − 4Y ≤ 12, X ≤ 1, X ≥ 0, Y ≥ 0 lies in fully in
Find the graphical solution for the system of linear inequation 2x + y ≤ 2, x − y ≤ 1
Find the solution set of inequalities 0 ≤ x ≤ 5, 0 ≤ 2y ≤ 7
Maximum value of 4x + 13y subject to constraints x ≥ 0, y ≥ 0, x + y ≤ 5 and 3x + y ≤ 9 is ______.
The minimum value of z = 10x + 25y subject to 0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≥ 5 is ______.
The maximum value of Z = 5x + 4y, Subject to y ≤ 2x, x ≤ 2y, x + y ≤ 3, x ≥ 0, y ≥ 0 is ______.
The minimum value of z = 2x + 9y subject to constraints x + y ≥ 1, 2x + 3y ≤ 6, x ≥ 0, y ≥ 0 is ______.
For the function z = 19x + 9y to be maximum under the constraints 2x + 3y ≤ 134, x + 5y ≤ 200, x ≥ 0, y ≥ 0; the values of x and y are ______.
The feasible region of an LPP is shown in the figure. If z = 3x + 9y, then the minimum value of z occurs at ______.
Maximise and Minimise Z = 3x – 4y subject to x – 2y ≤ 0, – 3x + y ≤ 4, x – y ≤ 6, x, y ≥ 0
Minimise z = – 3x + 4y subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0 What will be the minimum value of z ?
Solve the following Linear Programming Problem graphically:
Maximize Z = 400x + 300y subject to x + y ≤ 200, x ≤ 40, x ≥ 20, y ≥ 0
The maximum value of z = 5x + 2y, subject to the constraints x + y ≤ 7, x + 2y ≤ 10, x, y ≥ 0 is ______.
The objective function Z = x1 + x2, subject to the constraints are x1 + x2 ≤ 10, – 2x1 + 3x2 ≤ 15, x1 ≤ 6, x1, x2 ≥ 0, has maximum value ______ of the feasible region.
Solve the following Linear Programming problem graphically:
Maximize: Z = 3x + 3.5y
Subject to constraints:
x + 2y ≥ 240,
3x + 1.5y ≥ 270,
1.5x + 2y ≤ 310,
x ≥ 0, y ≥ 0.
Solve the following Linear Programming Problem graphically.
Maximise Z = 5x + 2y subject to:
x – 2y ≤ 2,
3x + 2y ≤ 12,
– 3x + 2y ≤ 3,
x ≥ 0, y ≥ 0
If x – y ≥ 8, x ≥ 3, y ≥ 3, x ≥ 0, y ≥ 0 then find the coordinates of the corner points of the feasible region.
Which statement defines a feasible solution?
For a bounded feasible region, where do the maximum and minimum values occur?
