Advertisements
Advertisements
प्रश्न
A firm manufactures two types of products A and B and sells them at a profit of Rs 5 per unit of type A and Rs 3 per unit of type B. Each product is processed on two machines M1 and M2. One unit of type A requires one minute of processing time on M1 and two minutes of processing time on M2, whereas one unit of type B requires one minute of processing time on M1 and one minute on M2. Machines M1 and M2 are respectively available for at most 5 hours and 6 hours in a day. Find out how many units of each type of product should the firm produce a day in order to maximize the profit. Solve the problem graphically.
Advertisements
उत्तर
Let x units of product A and y units of product B were manufactured.
Number of products cannot be negative.
Therefore, \[x, y \geq 0\]
According to question, the given information can be tabulated as
| Time on
\[M_1\]
|
Time on
\[M_2\]
|
|
| Product A(x) | 1 | 2 |
| Product B(y) | 1 | 1 |
| Availability | 300 | 360 |
The constraints are
\[x + y \leq 300\] \[2x + y \leq 360\]
Total profit = Z = \[5x + 3y\] which is to be maximised
Thus, the mathematical formulation of the given linear programmimg problem is
Max Z= \[5x + 3y\]
\[x + y \leq 300\] .
\[2x + y \leq 360\]
\[x, y \geq 0\]
First we will convert inequations into equations as follows:
x + y = 300, 2x + y = 360, x = 0 and y = 0
Region represented by x + y ≤ 300:
The line x + y = 300 meets the coordinate axes at A1(300, 0) and B1(0, 300) respectively. By joining these points we obtain the line
x + y = 30. Clearly (0,0) satisfies the x + y = 30. So, the region which contains the origin represents the solution set of the inequation
x + y ≤ 300.
Region represented by 2x + y ≤ 360:
The line 2x + y = 360 meets the coordinate axes at C1(180, 0) and D1(0, 360) respectively. By joining these points we obtain the line
2x + y = 360. Clearly (0,0) satisfies the inequation 2x + y ≤ 360. So,the region which contains the origin represents the solution set of the inequation 2x + y ≤ 360.
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 ≤ 300, 2x + y ≤ 360, x ≥ 0 and y ≥ 0 are as follows.
The corner points are O(0, 0), B1(0, 300), E1(60, 240) and C1(180, 0).
The values of Z at these corner points are as follows
| Corner point | Z= 5x + 3y |
| O | 0 |
| B1 | 900 |
| E1 | 1020 |
| C1 | 900 |
The maximum value of Z is Rs 1020 which is attained at B1\[\left( 60, 240 \right)\]
APPEARS IN
संबंधित प्रश्न
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.
Solve the following linear programming problem graphically :
Maximise Z = 7x + 10y subject to the constraints
4x + 6y ≤ 240
6x + 3y ≤ 240
x ≥ 10
x ≥ 0, 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.
Maximise z = 8x + 9y subject to the constraints given below :
2x + 3y ≤ 6
3x − 2y ≤6
y ≤ 1
x, y ≥ 0
Maximize Z = 9x + 3y
Subject to
2x + 3y ≤ 13
3x + y ≤ 5
x, y ≥ 0
Minimize Z = 30x + 20y
Subject to
\[x + y \leq 8\]
\[ x + 4y \geq 12\]
\[5x + 8y = 20\]
\[ x, y \geq 0\]
Minimize Z = x − 5y + 20
Subject to
\[x - y \geq 0\]
\[ - x + 2y \geq 2\]
\[ x \geq 3\]
\[ y \leq 4\]
\[ 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\]
Show the solution zone of the following inequalities on a graph paper:
\[5x + y \geq 10\]
\[ x + y \geq 6\]
\[x + 4y \geq 12\]
\[x \geq 0, y \geq 0\]
Find x and y for which 3x + 2y is minimum subject to these inequalities. Use a graphical method.
One kind of cake requires 300 gm of flour and 15 gm of fat, another kind of cake requires 150 gm of flour and 30 gm of fat. Find the maximum number of cakes which can be made from 7.5 kg of flour and 600 gm of fat, assuming that there is no shortage of the other ingradients used in making the cake. Make it as an LPP and solve it graphically.
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 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.
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.
There are two types of fertilizers F1 and F2. F1 consists of 10% nitrogen and 6% phosphoric acid and F2 consists of 5% nitrogen and 10% phosphoric acid. After testing the soil conditions, a farmer finds the she needs atleast 14 kg of nitrogen and 14 kg of phosphoric acid for her crop. If F1 costs ₹6/kg and F2 costs ₹5/kg, determine how much of each type of fertilizer should be used so that the nutrient requirements are met at minimum cost. What is the minimum cost?
A manufacturer considers that men and women workers are equally efficient and so he pays them at the same rate. He has 30 and 17 units of workers (male and female) and capital respectively, which he uses to produce two types of goods A and B. To produce one unit of A, 2 workers and 3 units of capital are required while 3 workers and 1 unit of capital is required to produce one unit of B. If A and B are priced at ₹100 and ₹120 per unit respectively, how should he use his resources to maximise the total revenue? Form the above as an LPP and solve graphically. Do you agree with this view of the manufacturer that men and women workers are equally efficient and so should be paid at the same rate?
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?
From the details given below, calculate the five-year moving averages of the number of students who have studied in a school. Also, plot these and original data on the same graph paper.
| Year | 1993 | 1994 | 1995 | 1996 | 1997 | 1998 | 1999 | 2000 | 2001 | 2002 |
| Number of Students | 332 | 317 | 357 | 392 | 402 | 405 | 410 | 427 | 405 | 438 |
Draw the graph of inequalities x ≤ 6, y −2 ≤ 0, x ≥ 0, y ≥ 0 and indicate the feasible region
The minimum value of z = 2x + 9y subject to constraints x + y ≥ 1, 2x + 3y ≤ 6, x ≥ 0, y ≥ 0 is ______.
The region XOY - plane which is represented by the inequalities -5 ≤ x ≤ 5, -5 ≤ y ≤ 5 is ______
Z = 20x1 + 20x2, subject to x1 ≥ 0, x2 ≥ 0, x1 + 2x2 ≥ 8, 3x1 + 2x2 ≥ 15, 5x1 + 2x2 ≥ 20. The minimum value of Z occurs at ____________.
A feasible solution to a linear programming problem
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 2x + y subject to 3x + 5y ≤ 26 and 5x + 3y ≤ 30, x ≥ 0, y ≥ 0 is ______.
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 corner points of the feasible region of a linear programming problem are (0, 4), (8, 0) and `(20/3, 4/3)`. If Z = 30x + 24y is the objective function, then (maximum value of Z – minimum value of Z) is equal to ______.
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.
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
Which point is an infeasible solution?
What is a corner point of a feasible region?
For \[x+y\leq50\], \[3x+y\leq90\], \[x\geq0\], and \[y\geq0\], which is a corner point of the feasible region?
For \[Z=4x+y\], which corner point gives the maximum value subject to \[x+y\leq50\], \[3x+y\leq90\], \[x\geq0\], and \[y\geq0\]?
What is the result if no feasible region exists?
