Advertisements
Advertisements
प्रश्न
Maximize Z = 15x + 10y
Subject to
\[3x + 2y \leq 80\]
\[2x + 3y \leq 70\]
\[ x, y \geq 0\]
Advertisements
उत्तर
First, we will convert the given inequations into equations, we obtain the following equations:
3x + 2y = 80, 2x + 3y = 70, x = 0 and y = 0
Region represented by 3x + 2y ≤ 80 :
The line 3x + 2y = 80 meets the coordinate axes at \[A\left( \frac{80}{3}, 0 \right)\] and \[B\left( 0, 40 \right)\]respectively. By joining these points we obtain the line 3x + 2y = 80.
Clearly (0,0) satisfies the inequation 3x + 2y ≤ 80 . So,the region containing the origin represents the solution set of the inequation 3x + 2y ≤ 80 .
Region represented by 2x + 3y ≤ 70:
The line 2x + 3y = 70 meets the coordinate axes at \[C\left( 35, 0 \right)\] and \[D\left( 0, \frac{70}{3} \right)\] respectively. By joining these points we obtain the line 2x + 3y ≤ 70.
Clearly (0,0) satisfies the inequation 2x + 3y ≤ 70. So,the region containing the origin represents the solution set of the inequation 2x + 3y ≤ 70.
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, 3x + 2y ≤ 80, 2x + 3y ≤ 70, x ≥ 0, and y ≥ 0 are as follows.
The corner points of the feasible region are O(0, 0), \[A\left( \frac{80}{3}, 0 \right)\] \[E\left( 20, 10 \right)\] and \[D\left( 0, \frac{70}{3} \right)\]
The values of Z at these corner points are as follows.
| Corner point | Z = 15x + 10y |
| O(0, 0) | 15 × 0 + 10 × 0 = 0 |
|
\[A\left( \frac{80}{3}, 0 \right)\]
|
15 × \[\frac{80}{3}\]+ 10 × 0 = 400
|
|
\[E\left( 20, 10 \right)\]
|
15 × 20 + 10 × 10 = 400 |
|
\[D\left( 0, \frac{70}{3} \right)\]
|
15 × 0 + 10 × \[\frac{70}{3}\] =\[\frac{700}{3}\]
|
We see that the maximum value of the objective function Z is 400 which is at \[A\left( \frac{80}{3}, 0 \right)\] and \[E\left( 20, 10 \right)\] Thus, the optimal value of Z is 400.
APPEARS IN
संबंधित प्रश्न
Minimize :Z=6x+4y
Subject to : 3x+2y ≥12
x+y ≥5
0 ≤x ≤4
0 ≤ y ≤ 4
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
Maximise Z = x + 2y subject to the constraints
`x + 2y >= 100`
`2x - y <= 0`
`2x + y <= 200`
Solve the above LPP graphically
Solve the following L.P.P graphically: Maximise Z = 20x + 10y
Subject to the following constraints x + 2y ≤ 28,
3x + y ≤ 24,
x ≥ 2,
x, 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.
Minimize Z = 5x + 3y
Subject to
\[2x + y \geq 10\]
\[x + 3y \geq 15\]
\[ x \leq 10\]
\[ y \leq 8\]
\[ 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 = 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.
Solved the following linear programming problem graphically:
Maximize Z = 60x + 15y
Subject to constraints
\[x + y \leq 50\]
\[3x + y \leq 90\]
\[ x, y \geq 0\]
A wholesale dealer deals in two kinds, A and B (say) of mixture of nuts. Each kg of mixture A contains 60 grams of almonds, 30 grams of cashew nuts and 30 grams of hazel nuts. Each kg of mixture B contains 30 grams of almonds, 60 grams of cashew nuts and 180 grams of hazel nuts. The remainder of both mixtures is per nuts. The dealer is contemplating to use mixtures A and B to make a bag which will contain at least 240 grams of almonds, 300 grams of cashew nuts and 540 grams of hazel nuts. Mixture A costs Rs 8 per kg. and mixture B costs Rs 12 per kg. Assuming that mixtures A and B are uniform, use graphical method to determine the number of kg. of each mixture which he should use to minimise the cost of the bag.
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 company produces two types of leather belts, say type A and B. Belt A is a superior quality and belt B is of a lower quality. Profits on each type of belt are Rs 2 and Rs 1.50 per belt, respectively. Each belt of type A requires twice as much time as required by a belt of type B. If all belts were of type B, the company could produce 1000 belts per day. But the supply of leather is sufficient only for 800 belts per day (both A and B combined). Belt A requires a fancy buckle and only 400 fancy buckles are available for this per day. For belt of type B, only 700 buckles are available per day.
How should the company manufacture the two types of belts in order to have a maximum overall profit?
A manufacturer makes two types A and B of tea-cups. Three machines are needed for the manufacture and the time in minutes required for each cup on the machines is given below:
| Machines | |||
| I | II | III | |
| A B |
12 6 |
18 0 |
6 9 |
Each machine is available for a maximum of 6 hours per day. If the profit on each cup A is 75 paise and that on each cup B is 50 paise, show that 15 tea-cups of type A and 30 of type B should be manufactured in a day to get the maximum profit.
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 | - |
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.
Anil wants to invest at most Rs 12000 in Saving Certificates and National Saving Bonds. According to rules, he has to invest at least Rs 2000 in Saving Certificates and at least Rs 4000 in National Saving Bonds. If the rate of interest on saving certificate is 8% per annum and the rate of interest on National Saving Bond is 10% per annum, how much money should he invest to earn maximum yearly income? Find also his maximum yearly income.
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 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.
A library has to accommodate two different types of books on a shelf. The books are 6 cm and 4 cm thick and weigh 1 kg and \[1\frac{1}{2}\] kg each respectively. The shelf is 96 cm long and atmost can support a weight of 21 kg. How should the shelf be filled with the books of two types in order to include the greatest number of books? Make it as an LPP and solve it graphically.
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.
(i) What number of rackets and bats must be made if the factory is to work at full capacity?
(ii) If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the maximum profit of the factory when it works at full capacity.
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?
The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is
A farmer has a supply of chemical fertilizer of type A which contains 10% nitrogen and 6% phosphoric acid and of type B which contains 5% nitrogen and 10% phosphoric acid. After the soil test, it is found that at least 7 kg of nitrogen and the same quantity of phosphoric acid is required for a good crop. The fertilizer of type A costs ₹ 5.00 per kg and the type B costs ₹ 8.00 per kg. Using Linear programming, find how many kilograms of each type of fertilizer should be bought to meet the requirement and for the cost to be minimum. Find the feasible region in the graph.
The minimum value of z = 10x + 25y subject to 0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≥ 5 is ______.
The maximum value of Z = 5x + 4y, Subject to y ≤ 2x, x ≤ 2y, x + y ≤ 3, x ≥ 0, y ≥ 0 is ______.
The point which provides the solution to the linear programming problem: Max P = 2x + 3y subject to constraints: x ≥ 0, y ≥ 0, 2x + 2y ≤ 9, 2x + y ≤ 7, x + 2y ≤ 8, is ______
Maximise and Minimise Z = 3x – 4y subject to x – 2y ≤ 0, – 3x + y ≤ 4, x – y ≤ 6, x, y ≥ 0
In linear programming feasible region (or solution region) for the problem 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 ____________.
Solve the following Linear Programming Problem graphically:
Maximize Z = 400x + 300y subject to x + y ≤ 200, x ≤ 40, x ≥ 20, y ≥ 0
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?
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:
Minimize: z = x + 2y,
Subject to the constraints: x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200, x, y ≥ 0.
If x – y ≥ 8, x ≥ 3, y ≥ 3, x ≥ 0, y ≥ 0 then find the coordinates of the corner points of the 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\]?
If two corner points give the same optimum value, which points are also optimal?
