Advertisements
Advertisements
प्रश्न
Minimize Z = 30x + 20y
Subject to
\[x + y \leq 8\]
\[ x + 4y \geq 12\]
\[5x + 8y = 20\]
\[ x, y \geq 0\]
Advertisements
उत्तर
First, we will convert the given inequations into equations, we obtain the following equations:
x + y = 8, x + 4y = 12, x = 0 and y = 0
5x + 8y = 20 is already an equation.
Region represented by x + y ≤ 8:
The line x + y = 8 meets the coordinate axes at A(8, 0) and B(0, 8) respectively. By joining these points we obtain the line x + y = 8.Clearly (0,0) satisfies the inequation x+ y ≤ 8. So,the region in xy plane which contain the origin represents the solution set of the inequation x + y ≤ 8.
Region represented by x + 4y ≥ 12:
The line x + 4y = 12 meets the coordinate axes at C(12, 0) and D(0, 3) respectively. By joining these points we obtain the line x + 4y = 12.Clearly (0,0) satisfies the inequation x + 4y ≥ 12. So,the region in xy plane which does not contain the origin represents the solution set of the inequation x + 4y ≥ 12.
The line 5x + 8y = 20 is the line that passes through E(4, 0) and \[F\left( 0, \frac{5}{2} \right)\] 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 x ≥ 0 and y ≥ 0.
The feasible region determined by the system of constraints, x + y ≤ 8, x + 4y ≥ 12, 5x+ 8y = 20, x ≥ 0 and y ≥ 0 are as follows.
The corner points of the feasible region are B(0,8), D(0,3),
The values of Z at these corner points are as follows.
| Corner point | Z = 30x + 20y |
| B(0,8) | 160 |
| D(0,3) | 60 |
|
\[G\left( \frac{20}{3}, \frac{4}{3} \right)\]
|
266.66 |
Therefore, the minimum value of Z is 60 at the point D(0,3). Hence, x = 0 and y =3 is the optimal solution of the given LPP.
Thus, the optimal value of Z is 60
APPEARS IN
संबंधित प्रश्न
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 dietician wishes to mix 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 arid 8 units of vitamin C. The vitamin contents of one kg food is given below:
| Food | Vitamin A | Vitamin.B | Vitamin C |
| X | 1 unit | 2 unit | 3 unit |
| Y | 2 unit | 2 unit | 1 unit |
Orie kg of food X costs Rs 24 and one kg of food Y costs Rs 36. Using Linear Programming, find the least cost of the total mixture. which will contain the required vitamins.
Maximize Z = 9x + 3y
Subject to
2x + 3y ≤ 13
3x + y ≤ 5
x, y ≥ 0
Minimize Z = 18x + 10y
Subject to
\[4x + y \geq 20\]
\[2x + 3y \geq 30\]
\[ x, y \geq 0\]
Maximize Z = 7x + 10y
Subject to
\[x + y \leq 30000\]
\[ y \leq 12000\]
\[ x \geq 6000\]
\[ x \geq y\]
\[ x, y \geq 0\]
Maximize Z = −x1 + 2x2
Subject to
\[- x_1 + 3 x_2 \leq 10\]
\[ x_1 + x_2 \leq 6\]
\[ x_1 - x_2 \leq 2\]
\[ x_1 , x_2 \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\]
Find the maximum and minimum value of 2x + y subject to the constraints:
x + 3y ≥ 6, x − 3y ≤ 3, 3x + 4y ≤ 24, − 3x + 2y ≤ 6, 5x + y ≥ 5, x, y ≥ 0.
Find graphically, the maximum value of Z = 2x + 5y, subject to constraints given below:
2x + 4y ≤ 8
3x + y ≤ 6
x + y ≤ 4
x ≥ 0, y ≥ 0
Solve the following linear programming problem graphically:
Minimize z = 6 x + 3 y
Subject to the constraints:
4 x + \[y \geq\] 80
x + 5 \[y \geq\] 115
3 x + 2 \[y \leq\] 150
\[x \geq\] 0 , \[y \geq\] 0
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.
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 small manufacturer has employed 5 skilled men and 10 semi-skilled men and makes an article in two qualities deluxe model and an ordinary model. The making of a deluxe model requires 2 hrs. work by a skilled man and 2 hrs. work by a semi-skilled man. The ordinary model requires 1 hr by a skilled man and 3 hrs. by a semi-skilled man. By union rules no man may work more than 8 hrs per day. The manufacturers clear profit on deluxe model is Rs 15 and on an ordinary model is Rs 10. How many of each type should be made in order to maximize his total daily profit.
A firm manufacturing two types of electric items, A and B, can make a profit of Rs 20 per unit of A and Rs 30 per unit of B. Each unit of A requires 3 motors and 4 transformers and each unit of B requires 2 motors and 4 transformers. The total supply of these per month is restricted to 210 motors and 300 transformers. Type B is an export model requiring a voltage stabilizer which has a supply restricted to 65 units per month. Formulate the linear programing problem for maximum profit and solve it graphically.
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 company manufactures two types of toys A and B. Type A requires 5 minutes each for cutting and 10 minutes each for assembling. Type B requires 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours available for cutting and 4 hours available for assembling in a day. The profit is Rs 50 each on type A and Rs 60 each on type B. How many toys of each type should the company manufacture in a day to maximize the 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 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. If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the number of tennis rackets and cricket bats that the factory must manufacture to earn the maximum profit. Make it as an LPP and solve it graphically.
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
Tow godowns, A and B, have grain storage capacity of 100 quintals and 50 quintals respectively. They supply to 3 ration shops, D, E and F, whose requirements are 60, 50 and 40 quintals respectively. The cost of transportation per quintal from the godowns to the shops are given in the following table:
| Transportation cost per quintal(in Rs.) | ||
| From-> | A | B |
| To | ||
| D | 6.00 | 4.00 |
| E | 3.00 | 2.00 |
| F | 2.50 | 3.00 |
How should the supplies be transported in order that the transportation cost is minimum?
A medical company has factories at two places, A and B. From these places, supply is made to each of its three agencies situated at P, Q and R. The monthly requirements of the agencies are respectively 40, 40 and 50 packets of the medicines, while the production capacity of the factories, A and B, are 60 and 70 packets respectively. The transportation cost per packet from the factories to the agencies are given below:
| Transportation Cost per packet(in Rs.) | ||
| From-> | A | B |
| To | ||
| P | 5 | 4 |
| Q | 4 | 2 |
| R | 3 | 5 |
The maximum value of z = 6x + 8y subject to x - y ≥ 0, x + 3y ≤ 12, x ≥ 0, y ≥ 0 is ______.
Let R be the feasible region for a linear programming problem, and let Z = ax + by be the objective function. If R is bounded, then ____________.
In the Corner point method for solving a linear programming problem the second step after finding the feasible region of the linear programming problem and determining its corner points is ____________.
The corner points of the bounded feasible region of a LPP are A(0,50), B(20, 40), C(50, 100) and D(0, 200) and the objective function is Z = x + 2y. Then the maximum value is ____________.
The maximum value of 2x + y subject to 3x + 5y ≤ 26 and 5x + 3y ≤ 30, x ≥ 0, y ≥ 0 is ______.
The shaded part of given figure indicates in feasible region, then the constraints are:
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: P = 70x + 40y
Subject to: 3x + 2y ≤ 9,
3x + y ≤ 9,
x ≥ 0,y ≥ 0.
Solve the following Linear Programming Problem graphically:
Maximize: z = – x + 2y,
Subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.
Draw the rough graph and shade the feasible region for the inequalities x + y ≥ 2, 2x + y ≤ 8, x ≥ 0, y ≥ 0.
A linear programming problem is given by Z = px + qy, where p, q > 0 subject to the constraints x + y ≤ 60, 5x + y ≤ 100, x ≥ 0 and y ≥ 0.
- Solve graphically to find the corner points of the feasible region.
- If Z = px + qy is maximum at (0, 60) and (10, 50), find the relation of p and q. Also mention the number of optimal solution(s) in this case.
