Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
Let x tickets of first class and y tickets of economy class were sold.
Number of tickets cannot be negative.
Therefore, \[x, y \geq 0\]
An aeroplane can carry a maximum of 200 passengers.
\[y \geq 4x\]
Total profit = Z = \[400x + 600y\] which is to be maximised
Thus, the mathematical formulation of the given linear programmimg problem is
Max Z = \[400x + 600y\]
\[y \geq 4x\]
\[x, y \geq 0\]
First we will convert inequations into equations as follows:
x + y =200, x = 20, y = 4x, x = 0 and y = 0
Region represented by x + y ≤ 200:
The line x + y = 200 meets the coordinate axes at A(200, 0) and B(0, 200) respectively.
x + y = 200. Clearly (0,0) satisfies the inequation x + y ≤ 200. So,the region which contains the origin represents the solution set of the inequation x + y ≤ 200.
Region represented by x ≥ 20:
The line x = 20 is the line that passes through (20, 0) and is parallel to Y axis.The region to the right of the line x = 20 will satisfy the inequation x ≥ 20.
Region represented by y ≥ 4x:
The line y = 4x is the line that passes through (0, 0).The region above the line y = 4x will satisfy the inequation y ≥ 4x.Let us understand by taking one point which is below the line y = 4x. Let it be (1, 3).Here, 3 < 4 which does not satisfy the inequation y ≥ 4x. Hence, the region above the line y = 4x will satisfy the inequation y ≥ 4x.
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 ≤ 200, x ≥ 20, y ≥ 4x,x ≥ 0 and y ≥ 0 are as follows.
The corner points are C(20, 80), D(40, 160), E(20, 180). The values of Z at these corner points are as follows
| Corner point | Z = 400x + 600y |
| C | 56000 |
| D | 112000 |
| E | 116000 |
The maximum value of Z is 116000 which is attained at C(20, 180).
Thus, the maximum profit is Rs 116000 obtained when 20 first class tickets and 180 economy class tickets were sold
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
Minimum and maximum z = 5x + 2y subject to the following constraints:
x-2y ≤ 2
3x+2y ≤ 12
-3x+2y ≤ 3
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.
Solve the following LPP by graphical method:
Minimize Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, 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
Minimize Z = 18x + 10y
Subject to
\[4x + y \geq 20\]
\[2x + 3y \geq 30\]
\[ x, y \geq 0\]
Maximize Z = 50x + 30y
Subject to
\[2x + y \leq 18\]
\[3x + 2y \leq 34\]
\[ x, y \geq 0\]
Minimize Z = 5x + 3y
Subject to
\[2x + y \geq 10\]
\[x + 3y \geq 15\]
\[ x \leq 10\]
\[ y \leq 8\]
\[ x, y \geq 0\]
Maximize Z = 3x + 3y, if possible,
Subject to the constraints
\[x - y \leq 1\]
\[x + y \geq 3\]
\[ x, y \geq 0\]
Find the minimum value of 3x + 5y subject to the constraints
− 2x + y ≤ 4, x + y ≥ 3, x − 2y ≤ 2, 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
Kellogg is a new cereal formed of a mixture of bran and rice that contains at least 88 grams of protein and at least 36 milligrams of iron. Knowing that bran contains 80 grams of protein and 40 milligrams of iron per kilogram, and that rice contains 100 grams of protein and 30 milligrams of iron per kilogram, find the minimum cost of producing this new cereal if bran costs Rs 5 per kg and rice costs Rs 4 per kg
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 dietician has to develop a special diet using two foods P and Q. Each packet (containing 30 g) of food P contains 12 units of calcium, 4 units of iron, 6 units of cholesterol and 6 units of vitamin A. Each packet of the same quantity of food Q contains 3 units of calcium, 20 units of iron, 4 units of cholesterol and 3 units of vitamin A. The diet requires atleast 240 units of calcium, atleast 460 units of iron and at most 300 units of cholesterol. How many packets of each food should be used to minimise the amount of vitamin A in the diet? What is the minimum of vitamin A.
A factory manufactures two types of screws, A and B, each type requiring the use of two machines - an automatic and a hand-operated. It takes 4 minute on the automatic and 6 minutes on the hand-operated machines to manufacture a package of screws 'A', while it takes 6 minutes on the automatic and 3 minutes on the hand-operated machine to manufacture a package of screws 'B'. Each machine is available for at most 4 hours on any day. The manufacturer can sell a package of screws 'A' at a profit of 70 P and screws 'B' at a profit of Rs 1. Assuming that he can sell all the screws he can manufacture, how many packages of each type should the factory owner produce in a day in order to maximize his profit? Determine the maximum profit.
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 manufactures headache pills in two sizes A and B. Size A contains 2 grains of aspirin, 5 grains of bicarbonate and 1 grain of codeine; size B contains 1 grain of aspirin, 8 grains of bicarbonate and 66 grains of codeine. It has been found by users that it requires at least 12 grains of aspirin, 7.4 grains of bicarbonate and 24 grains of codeine for providing immediate effects. Determine graphically the least number of pills a patient should have to get immediate relief. Determine also the quantity of codeine consumed by patient.
A chemical company produces two compounds, A and B. The following table gives the units of ingredients, C and D per kg of compounds A and B as well as minimum requirements of C and D and costs per kg of A and B. Find the quantities of A and B which would give a supply of C and D at a minimum cost.
| Compound | Minimum requirement | ||
| A | B | ||
| Ingredient C Ingredient D |
1 3 |
2 1 |
80 75 |
| Cost (in Rs) per kg | 4 | 6 | - |
A firm makes items A and B and the total number of items it can make in a day is 24. It takes one hour to make an item of A and half an hour to make an item of B. The maximum time available per day is 16 hours. The profit on an item of A is Rs 300 and on one item of B is Rs 160. How many items of each type should be produced to maximize the profit? Solve the problem graphically.
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 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.
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?
Find the solution set of inequalities 0 ≤ x ≤ 5, 0 ≤ 2y ≤ 7
Draw the graph of inequalities x ≤ 6, y −2 ≤ 0, x ≥ 0, y ≥ 0 and indicate the feasible region
Area of the region bounded by y = cos x, x = 0, x = π and X-axis is ______ sq.units.
In linear programming feasible region (or solution region) for the problem is ____________.
The solution set of the inequality 3x + 5y < 4 is ______.
Solve the following Linear Programming Problem graphically:
Maximize Z = 400x + 300y subject to x + y ≤ 200, x ≤ 40, x ≥ 20, y ≥ 0
The constraints –x1 + x2 ≤ 1, –x1 + 3x2 ≤ 9, x1x2 ≥ 0 define on ______.
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:
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.
What is a corner point of a feasible region?
The Corner Point Method is based on which theorem?
For \[Z=4x+y\], which corner point gives the maximum value subject to \[x+y\leq50\], \[3x+y\leq90\], \[x\geq0\], and \[y\geq0\]?
