Advertisements
Advertisements
प्रश्न
Minimize Z = 5x + 3y
Subject to
\[2x + y \geq 10\]
\[x + 3y \geq 15\]
\[ x \leq 10\]
\[ y \leq 8\]
\[ x, y \geq 0\]
उत्तर
First, we will convert the given inequations into equations, we obtain the following equations:
2x + y = 10, x + 3y = 15, x = 10, y = 8
Region represented by 2x + y ≥ 10:
The line 2x + y = 10 meets the coordinate axes at A(5, 0) and B(0, 10) respectively. By joining these points we obtain the line 2x + y = 10.
Clearly (0,0) does not satisfies the inequation 2x + y ≥ 10. So,the region in xy plane which does not contain the origin represents the solution set of the inequation 2x + y≥ 10.
Region represented by x + 3y ≥ 15:
The line x + 3y = 15 meets the coordinate axes at C(15, 0) and D(0, 5) respectively. By joining these points we obtain the line x + 3y = 15.
Clearly (0,0) satisfies the inequation x + 3y ≥ 15. o,the region in xy plane which does not contain the origin represents the solution set of the inequation x + 3y ≥ 15.
The line x = 10 is the line that passes through the point (10, 0) and is parallel to Yaxis.x ≤ 10 is the region to the left of the line x = 10.
The line y = 8 is the line that passes through the point (0, 8) and is parallel to X axis.y ≤ 8 is the region below the line y = 8.
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, 2x + y ≥ 10, x + 3y ≥ 15, x ≤ 10, y ≤ 8, x ≥ 0 and y ≥ 0 are as follows.
The corner points of the feasible region are E(3, 4), \[H\left( 10, \frac{5}{3} \right)\] F(10, 8) and G(1, 8).
| Corner point | Z = 5x + 3y |
| E(3, 4) | 5 × 3 + 3 × 4 = 27 |
|
\[H\left( 10, \frac{5}{3} \right)\]
|
5 × 10 + 3× \[\frac{5}{3}\] = 55
|
| F(10, 8) | 5 × 10 + 3 × 8 = 74 |
| G(1, 8) | 5 × 1 + 3 × 8 = 29 |
Thus, the optimal value of Z is 27.
APPEARS IN
संबंधित प्रश्न
Minimize :Z=6x+4y
Subject to : 3x+2y ≥12
x+y ≥5
0 ≤x ≤4
0 ≤ y ≤ 4
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.
In order to supplement daily diet, a person wishes to take X and Y tablets. The contents (in milligrams per tablet) of iron, calcium and vitamins in X and Y are given as below :
| Tablets | Iron | Calcium | Vitamin |
| x | 6 | 3 | 2 |
| y | 2 | 3 | 4 |
The person needs to supplement at least 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamins. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each type should the person take in order to satisfy the above requirement at the minimum cost? Make an LPP and solve graphically.
Minimize Z = 18x + 10y
Subject to
\[4x + y \geq 20\]
\[2x + 3y \geq 30\]
\[ x, y \geq 0\]
Minimize Z = 30x + 20y
Subject to
\[x + y \leq 8\]
\[ x + 4y \geq 12\]
\[5x + 8y = 20\]
\[ x, y \geq 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 = −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\]
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.
A diet for a sick person must contain at least 4000 units of vitamins, 50 units of minerals and 1400 of calories. Two foods A and B, are available at a cost of Rs 4 and Rs 3 per unit respectively. If one unit of A contains 200 units of vitamin, 1 unit of mineral and 40 calories and one unit of food B contains 100 units of vitamin, 2 units of minerals and 40 calories, find what combination of foods should be used to have the least cost?
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
A farmer mixes two brands P and Q of cattle feed. Brand P, costing ₹250 per bag, contains 2 units of nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing ₹200 per bag contains 1.5 units of nutritional element A, 11.25 units of element B and 3 units of element C. The minimum requirements of nutrients A, B and C are 18 units, 45 units and 24 units respectively. Determine the number of bags of each brand which should be mixed in order to produce a mixture having a minimum cost per bag? What is the minimum cost of the mixture per bag?
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 factory owner purchases two types of machines, A and B, for his factory. The requirements and limitations for the machines are as follows:
| Area occupied by the machine |
Labour force for each machine |
Daily output in units |
|
| Machine A Machine B |
1000 sq. m 1200 sq. m |
12 men 8 men |
60 40 |
He has an area of 7600 sq. m available and 72 skilled men who can operate the machines.
How many machines of each type should he buy to maximize the daily output?
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.
An oil company has two depots, A and B, with capacities of 7000 litres and 4000 litres respectively. The company is to supply oil to three petrol pumps, D, E, F whose requirements are 4500, 3000 and 3500 litres respectively. The distance (in km) between the depots and petrol pumps is given in the following table:
Figure
Assuming that the transportation cost per km is Rs 1.00 per litre, how should the delivery be scheduled in order that the transportation cost is minimum?
A cooperative society of farmers has 50 hectares of land to grow two crops X and Y. The profits from crops X and Y per hectare are estimated as ₹10,500 and ₹9,000 respectively. To control weeds, a liquid herbicide has to be used for crops X and Y at the rate of 20 litres and 10 litres per hectare, respectively. Further not more than 800 litres of herbicide should be used in order to protect fish and wildlife using a pond which collects drainage from this land. How much land should be allocated to each crop so as to maximise the total profit of the society?
The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is
Maximize: z = 3x + 5y Subject to
x +4y ≤ 24 3x + y ≤ 21
x + y ≤ 9 x ≥ 0 , y ≥0
A carpenter has 90, 80 and 50 running feet respectively of teak wood, plywood and rosewood which is used to product A and product B. Each unit of product A requires 2, 1 and 1 running feet and each unit of product B requires 1, 2 and 1 running feet of teak wood, plywood and rosewood respectively. If product A is sold for Rs. 48 per unit and product B is sold for Rs. 40 per unit, how many units of product A and product B should be produced and sold by the carpenter, in order to obtain the maximum gross income? Formulate the above as a Linear Programming Problem and solve it, indicating clearly the feasible region in the graph.
The graph of the inequality 3X − 4Y ≤ 12, X ≤ 1, X ≥ 0, Y ≥ 0 lies in fully in
For L.P.P. maximize z = 4x1 + 2x2 subject to 3x1 + 2x2 ≥ 9, x1 - x2 ≤ 3, x1 ≥ 0, x2 ≥ 0 has ______.
Area of the region bounded by y = cos x, x = 0, x = π and X-axis is ______ sq.units.
The feasible region of an LPP is shown in the figure. If z = 3x + 9y, then the minimum value of z occurs at ______.
If 4x + 5y ≤ 20, x + y ≥ 3, x ≥ 0, y ≥ 0, maximum 2x + 3y is ______.
The maximum of z = 5x + 2y, subject to the constraints x + y ≤ 7, x + 2y ≤ 10, x, y ≥ 0 is ______.
Maximise and Minimise Z = 3x – 4y subject to x – 2y ≤ 0, – 3x + y ≤ 4, x – y ≤ 6, x, y ≥ 0
Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints described by linear inequalities,
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 the objective function Z has both a maximum and a minimum value on R and ____________.
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 feasible region (shaded) for a L.P.P is shown in the figure. The maximum Z = 5x + 7y is ____________.
Which of the statements describe the solution set for `-2(x + 8) = - 2x + 20`?
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.
The objective function Z = ax + by of an LPP has maximum vaiue 42 at (4, 6) and minimum value 19 at (3, 2). Which of the following is true?
The feasible region corresponding to the linear constraints of a Linear Programming Problem is given below.
Which of the following is not a constraint to the given Linear Programming Problem?
Find feasible solution for the following system of linear inequation graphically.
3x + 4y ≥ 12, 4x + 7y ≤ 28, x ≥ 0, y ≥ 0
