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
Minimize `z=4x+5y ` subject to `2x+y>=7, 2x+3y<=15, x<=3,x>=0, y>=0` solve using graphical method.
A dealer in rural area wishes to purchase a number of sewing machines. He has only Rs 5,760 to invest and has space for at most 20 items for storage. An electronic sewing machine cost him Rs 360 and a manually operated sewing machine Rs 240. He can sell an electronic sewing machine at a profit of Rs 22 and a manually operated sewing machine at a profit of Rs 18. Assuming that he can sell all the items that he can buy, how should he invest his money in order to maximize his profit? Make it as a LPP and solve it graphically.
A manufacturer produces two products A and B. Both the products are processed on two different machines. The available capacity of first machine is 12 hours and that of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at Rs 7 profit and B at a profit of Rs 4. Find the production level per day for maximum profit graphically.
Find graphically, the maximum value of z = 2x + 5y, subject to constraints given below :
2x + 4y ≤ 83
x + y ≤ 6
x + y ≤ 4
x ≥ 0, y≥ 0
A company manufactures bicycles and tricycles each of which must be processed through machines A and B. Machine A has maximum of 120 hours available and machine B has maximum of 180 hours available. 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 Rs. 180 for a bicycle and Rs. 220 for a tricycle, formulate and solve the L.P.P. to determine the number of bicycles and tricycles that should be manufactured in order to maximize the profit.
Maximise Z = x + 2y subject to the constraints
`x + 2y >= 100`
`2x - y <= 0`
`2x + y <= 200`
Solve the above LPP graphically
Solve the following L.P.P. graphically:
Minimise Z = 5x + 10y
Subject to x + 2y ≤ 120
Constraints x + y ≥ 60
x – 2y ≥ 0 and x, y ≥ 0
Solve the following LPP graphically :
Maximise Z = 105x + 90y
subject to the constraints
x + y ≤ 50
2x + y ≤ 80
x ≥ 0, y ≥ 0.
Minimize Z = 3x1 + 5x2
Subject to
\[x_1 + 3 x_2 \geq 3\]
\[ x_1 + x_2 \geq 2\]
\[ x_1 , x_2 \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 = x + y
Subject to
\[- 2x + y \leq 1\]
\[ x \leq 2\]
\[ x + y \leq 3\]
\[ 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\]
A diet of two foods F1 and F2 contains nutrients thiamine, phosphorous and iron. The amount of each nutrient in each of the food (in milligrams per 25 gms) is given in the following table:
Nutrients |
Food |
F1 | F2 |
| Thiamine | 0.25 | 0.10 |
|
| Phosphorous | 0.75 | 1.50 | |
| Iron | 1.60 | 0.80 | |
The minimum requirement of the nutrients in the diet are 1.00 mg of thiamine, 7.50 mg of phosphorous and 10.00 mg of iron. The cost of F1 is 20 paise per 25 gms while the cost of F2 is 15 paise per 25 gms. Find the minimum cost of diet.
A diet is to contain at least 80 units of vitamin A and 100 units of minerals. Two foods F1and F2 are available. Food F1 costs Rs 4 per unit and F2 costs Rs 6 per unit one unit of food F1 contains 3 units of vitamin A and 4 units of minerals. One unit of food F2contains 6 units of vitamin A and 3 units of minerals. Formulate this as a linear programming problem and find graphically the minimum cost for diet that consists of mixture of these foods and also meets the mineral nutritional requirements
One kind of cake requires 200 g of flour and 25 g of fat, and another kind of cake requires 100 g of flour and 50 g of fat. Find the maximum number of cakes which can be made from 5 kg of flour and 1 kg of fat assuming that there is no storage of the other ingredients used in making the cakes.
A dietician wishes to mix together two kinds of food X and Y in such a way that the mixture contains at least 10 units of vitamin A, 12 units of vitamin B and 8 units of vitamin C. The vitamin contents of one kg food is given below:
| Food | Vitamin A | Vitamin B | Vitamin C |
| X | 1 | 2 | 3 |
| Y | 2 | 2 | 1 |
One kg of food X costs ₹16 and one kg of food Y costs ₹20. Find the least cost of the mixture which will produce the required diet?
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?
An aeroplane can carry a maximum of 200 passengers. A profit of Rs 400 is made on each first class ticket and a profit of Rs 600 is made on each economy class ticket. The airline reserves at least 20 seats of first class. However, at least 4 times as many passengers prefer to travel by economy class to the first class. Determine how many each type of tickets must be sold in order to maximize the profit for the airline. What is the maximum profit.
A man owns a field of area 1000 sq.m. He wants to plant fruit trees in it. He has a sum of Rs 1400 to purchase young trees. He has the choice of two types of trees. Type A requires 10 sq.m of ground per tree and costs Rs 20 per tree and type B requires 20 sq.m of ground per tree and costs Rs 25 per tree. When fully grown, type A produces an average of 20 kg of fruit which can be sold at a profit of Rs 2.00 per kg and type B produces an average of 40 kg of fruit which can be sold at a profit of Rs. 1.50 per kg. How many of each type should be planted to achieve maximum profit when the trees are fully grown? What is the maximum profit?
If a young man drives his vehicle at 25 km/hr, he has to spend ₹2 per km on petrol. If he drives it at a faster speed of 40 km/hr, the petrol cost increases to ₹5 per km. He has ₹100 to spend on petrol and travel within one hour. Express this as an LPP and solve the same.
A small firm manufactures gold rings and chains. The total number of rings and chains manufactured per day is at most 24. It takes 1 hour to make a ring and 30 minutes to make a chain. The maximum number of hours available per day is 16. If the profit on a ring is Rs 300 and that on a chain is Rs 190, find the number of rings and chains that should be manufactured per day, so as to earn the maximum profit. Make it as an LPP and solve it graphically.
A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time and 3 hours of craftman's time in its making while a cricket bat takes 3 hours of machine time and 1 hour of craftman's time. In a day, the factory has the availability of not more than 42 hours of machine time and 24 hours of craftman's time.
(i) What number of rackets and bats must be made if the factory is to work at full capacity?
(ii) If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the maximum profit of the factory when it works at full capacity.
A merchant plans to sell two types of personal computers a desktop model and a portable model that will cost Rs 25,000 and Rs 40,000 respectively. He estimates that the total monthly demand of computers will not exceed 250 units. Determine the number of units of each type of computers which the merchant should stock to get maximum profit if he does not want to invest more than Rs 70 lakhs and his profit on the desktop model is Rs 4500 and on the portable model is Rs 5000.
A manufacturer produces two products A and B. Both the products are processed on two different machines. The available capacity of first machine is 12 hours and that of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at ₹7 profit and that of B at a profit of ₹4. Find the production level per day for maximum profit graphically.
By graphical method, the solution of linear programming problem
\[\text{ Subject } to \text{ 3 } x_1 + 2 x_2 \leq 18\]
\[ x_1 \leq 4\]
\[ x_2 \leq 6\]
\[ x_1 \geq 0, x_2 \geq 0, \text{ is } \]
A farmer has a supply of chemical fertilizer of type A which contains 10% nitrogen and 6% phosphoric acid and of type B which contains 5% nitrogen and 10% phosphoric acid. After the soil test, it is found that at least 7 kg of nitrogen and the same quantity of phosphoric acid is required for a good crop. The fertilizer of type A costs ₹ 5.00 per kg and the type B costs ₹ 8.00 per kg. Using Linear programming, find how many kilograms of each type of fertilizer should be bought to meet the requirement and for the cost to be minimum. Find the feasible region in the graph.
A manufacturer has employed 5 skilled men and 10 semi-skilled men and makes two models A and B of an article. The making of one item of model A requires 2 hours of work by a skilled man and 2 hours work by a semi-skilled man. One item of model B requires 1 hour by a skilled man and 3 hours by a semi-skilled man. No man is expected to work more than 8 hours per day. The manufacturer's profit on an item of model A is ₹ 15 and on an item of model B is ₹ 10. How many items of each model should be made per day in order to maximize daily profit? Formulate the above LPP and solve it graphically and find the maximum profit.
The graph of the inequality 3X − 4Y ≤ 12, X ≤ 1, X ≥ 0, Y ≥ 0 lies in fully in
Sketch the graph of inequation x ≥ 5y in xoy co-ordinate system
The maximum value of z = 6x + 8y subject to x - y ≥ 0, x + 3y ≤ 12, x ≥ 0, y ≥ 0 is ______.
The region XOY - plane which is represented by the inequalities -5 ≤ x ≤ 5, -5 ≤ y ≤ 5 is ______
A feasible solution to a linear programming problem
The maximum value of Z = 3x + 4y subjected to contraints x + y ≤ 40, x + 2y ≤ 60, x ≥ 0 and y ≥ 0 is ____________.
The comer point 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 x = Px + qx where P, q > 0 condition on P and Q so that the maximum of z occurs at both (3, 4) and (0, 5) is
Any point in the feasible region that gives the optional value (maximum or minimum) of the objective function is called:-
Solve the following linear programming problem graphically:
Minimize: Z = 5x + 10y
Subject to constraints:
x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0.
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.
Draw the rough graph and shade the feasible region for the inequalities x + y ≥ 2, 2x + y ≤ 8, x ≥ 0, y ≥ 0.
