Advertisements
Advertisements
प्रश्न
A manufacturer of Furniture makes two products : chairs and tables. processing of these products is done on two machines A and B. A chair requires 2 hrs on machine A and 6 hrs on machine B. A table requires 4 hrs on machine A and 2 hrs on machine B. There are 16 hrs of time per day available on machine A and 30 hrs on machine B. Profit gained by the manufacturer from a chair and a table is Rs 3 and Rs 5 respectively. Find with the help of graph what should be the daily production of each of the two products so as to maximize his profit.
Advertisements
उत्तर
Let x chairs and y tables were produced.
Number of chairs and tables cannot be negative.
Therefore, \[x, y \geq 0\]
The given information can be tabulated as follows:
| Time on machine A(hrs) | Time on machine B (hrs) | |
| Chairs | 2 | 6 |
| Tables | 4 | 2 |
| Availability | 16 | 30 |
Therefore, the constraints are
\[2x + 4y \leq 16\]
\[6x + 2y \leq 30\]
Profit gained by the manufacturer from a chair and a table is Rs 3 and Rs 5 respectively. Therefore, profit gained from x chairs and y tables is Rs 3x and Rs 5y.
Total profit = Z = \[3x + 5y\] which is to be maximised
Thus, the mathematical formulation of the given linear programmimg problem is
Max Z = \[3x + 5y\]
subject to
\[2x + 4y \leq 16\]
\[6x + 2y \leq 30\]
First we will convert inequations into equations as follows:
2x + 4y = 16, 6x + 2y =30, x = 0 and y = 0
Region represented by 2x + 4y ≤ 16:
The line 2x + 4y = 16 meets the coordinate axes at A1(8, 0) and B1(0, 4) respectively. By joining these points we obtain the line 2x + 4y = 16. Clearly (0,0) satisfies the 2x + 4y = 16. So, the region which contains the origin represents the solution set of the inequation 2x + 4y ≤ 16.
Region represented by 6x + 2y ≤ 30:
The line 6x + 2y =30 meets the coordinate axes at C1(5, 0) and D1(0, 15) respectively. By joining these points we obtain the line 6x + 2y =30 . Clearly (0,0) satisfies the inequation 6x + 2y ≤ 30. So,the region which contains the origin represents the solution set of the inequation 6x + 2y ≤ 30.
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 + 4y ≤ 16, 6x + 2y ≤ 30, x ≥ 0, and y ≥ 0 are as follows.
The corner points are O(0, 0), B1(0, 4), E1
The values of Z at these corner points are as follows
| Corner point | Z= 3x + 5y |
| O | 0 |
| B1 | 20 |
| E1 | 22.2 |
| C1 | 15 |
The maximum value of Z is 22.2 which is attained at B1
APPEARS IN
संबंधित प्रश्न
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 Rs 10 per kg and 'B' cost Rs 8 per kg, then graphically determine how much of each type of fertiliser should be used so that nutrient requirements are met at a minimum cost
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
Minimize Z = 18x + 10y
Subject to
\[4x + y \geq 20\]
\[2x + 3y \geq 30\]
\[ x, y \geq 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 dietician mixes together two kinds of food in such a way that the mixture contains at least 6 units of vitamin A, 7 units of vitamin B, 11 units of vitamin C and 9 units of vitamin D. The vitamin contents of 1 kg of food X and 1 kg of food Y are given below:
| Vitamin A |
Vitamin B |
Vitamin |
Vitamin D |
|
| Food X Food Y |
1 2 |
1 1 |
1 3 |
2 1 |
One kg food X costs Rs 5, whereas one kg of food Y costs Rs 8. Find the least cost of the mixture which will produce the desired diet.
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 cottage industry manufactures pedestal lamps and wooden shades, each requiring the use of grinding/cutting machine and sprayer. It takes 2 hours on the grinding/cutting machine and 3 hours on the sprayer to manufacture a pedestal lamp while it takes 1 hour on the grinding/cutting machine and 2 hours on the sprayer to manufacture a shade. On any day, the sprayer is available for at most 20 hours and the grinding/cutting machine for at most 12 hours. The profit from the sale of a lamp is ₹5.00 and a shade is ₹3.00. Assuming that the manufacturer sell all the lamps and shades that he produces, how should he schedule his daily production in order to maximise his profit?
A producer has 30 and 17 units of labour and capital respectively which he can use to produce two type of goods x and y. To produce one unit of x, 2 units of labour and 3 units of capital are required. Similarly, 3 units of labour and 1 unit of capital is required to produce one unit of y. If x and y are priced at Rs 100 and Rs 120 per unit respectively, how should be producer use his resources to maximize the total revenue? Solve the problem graphically.
A small firm manufacturers items A and B. The total number of items A and B that it can manufacture in a day is at the most 24. Item A takes one hour to make while item B takes only half an hour. The maximum time available per day is 16 hours. If the profit on one unit of item A be Rs 300 and one unit of item B be Rs 160, how many of each type of item be produced to maximize the profit? Solve the problem graphically.
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 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 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.
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 has three machine I, II, III installed in his factory. Machines I and II are capable of being operated for at most 12 hours whereas machine III must be operated for atleast 5 hours a day. She produces only two items M and N each requiring the use of all the three machines.
The number of hours required for producing 1 unit each of M and N on the three machines are given in the following table:
| Items | Number of hours required on machines | ||
| I | II | III | |
| M | 1 | 2 | 1 |
| N | 2 | 1 | 1.25 |
She makes a profit of ₹600 and ₹400 on items M and N respectively. How many of each item should she produce so as to maximise her profit assuming that she can sell all the items that she produced? What will be the maximum profit?
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 point at which the maximum value of x + y subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x ≥ 0, y ≥ 0 is obtained, is ______.
The value of objective function is maximum under linear constraints ______.
Find the solution set of inequalities 0 ≤ x ≤ 5, 0 ≤ 2y ≤ 7
The maximum value of z = 3x + 10y subjected to the conditions 5x + 2y ≤ 10, 3x + 5y ≤ 15, x, y ≥ 0 is ______.
Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) 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 the objective function Z has both a maximum and a minimum value on R and ____________.
The solution set of the inequality 3x + 5y < 4 is ______.
The corner points of the shaded unbounded feasible region of an LPP are (0, 4), (0.6, 1.6) and (3, 0) as shown in the figure. The minimum value of the objective function Z = 4x + 6y occurs at ______.
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?
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.
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:
Minimize: z = x + 2y,
Subject to the constraints: x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200, x, y ≥ 0.
Find feasible solution for the following system of linear inequation graphically.
3x + 4y ≥ 12, 4x + 7y ≤ 28, 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.
Which statement defines a feasible solution?
Which point is an infeasible solution?
Which description represents an unbounded region?
What does the Extreme Point Theorem state about the optimum solution of an LPP, if it exists?
For a bounded feasible region, where do the maximum and minimum values occur?
