Advertisements
Advertisements
Question
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
Advertisements
Solution
The feasible region determined by the constraints, x + 2y ≤ 120, x + y ≥ 60, x − 2y ≥ 0, x ≥ 0, and y ≥ 0, is as follows.
The corner points of the feasible region are A (60, 0), B (120, 0), C (60, 30), and D (40, 20)
The values of Z at these corner points are as follows.
| Corner point | Z = 5x + 10y | |
| A(60, 0) | 300 | →Minimum |
| B(120, 0) | 600 | →Maximum |
| C(60, 30) | 600 | →Maximum |
| D(40, 20) | 400 |
The minimum value of Z is 300 at (60, 0).
APPEARS IN
RELATED QUESTIONS
Maximise Z = x + 2y subject to the constraints
`x + 2y >= 100`
`2x - y <= 0`
`2x + y <= 200`
Solve the above LPP graphically
Maximize Z = 9x + 3y
Subject to
2x + 3y ≤ 13
3x + y ≤ 5
x, y ≥ 0
Maximize Z = 50x + 30y
Subject to
\[2x + y \leq 18\]
\[3x + 2y \leq 34\]
\[ x, y \geq 0\]
Maximize Z = 4x + 3y
subject to
\[3x + 4y \leq 24\]
\[8x + 6y \leq 48\]
\[ x \leq 5\]
\[ y \leq 6\]
\[ 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.
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 hospital dietician wishes to find the cheapest combination of two foods, A and B, that contains at least 0.5 milligram of thiamin and at least 600 calories. Each unit of Acontains 0.12 milligram of thiamin and 100 calories, while each unit of B contains 0.10 milligram of thiamin and 150 calories. If each food costs 10 paise per unit, how many units of each should be combined at a minimum cost?
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 fruit grower can use two types of fertilizer in his garden, brand P and Q. The amounts (in kg) of nirogen, phosphoric acid, potash, and chlorine in a bag of each brand are given in the table. Tests indicates that the garden needs at least 240 kg of phosphoric acid, at least 270 kg of potash and at most 310 kg of chlorine.
| kg per bag | ||
| Brand P | Brand P | |
| Nitrogen | 3 | 3.5 |
| Phosphoric acid | 1 | 2 |
| Potash | 3 | 1.5 |
| Chlorine | 1.5 | 2 |
If the grower wants to minimize the amount of nitrogen added to the garden, how many bags of each brand should be used? What is the minimum amount of nitrogen added in the garden?
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.
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 factory uses three different resources for the manufacture of two different products, 20 units of the resources A, 12 units of B and 16 units of C being available. 1 unit of the first product requires 2, 2 and 4 units of the respective resources and 1 unit of the second product requires 4, 2 and 0 units of respective resources. It is known that the first product gives a profit of 2 monetary units per unit and the second 3. Formulate the linear programming problem. How many units of each product should be manufactured for maximizing the profit? Solve it graphically.
A manufacturer makes two products A and B. Product A sells at Rs 200 each and takes 1/2 hour to make. Product B sells at Rs 300 each and takes 1 hour to make. There is a permanent order for 14 of product A and 16 of product B. A working week consists of 40 hours of production and weekly turnover must not be less than Rs 10000. If the profit on each of product A is Rs 20 and on product B is Rs 30, then how many of each should be produced so that the profit is maximum. Also, find the maximum profit.
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.
A company manufactures two articles A and B. There are two departments through which these articles are processed: (i) assembly and (ii) finishing departments. The maximum capacity of the first department is 60 hours a week and that of other department is 48 hours per week. The product of each unit of article A requires 4 hours in assembly and 2 hours in finishing and that of each unit of B requires 2 hours in assembly and 4 hours in finishing. If the profit is Rs 6 for each unit of A and Rs 8 for each unit of B, find the number of units of A and B to be produced per week in order to have maximum profit.
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.
An aeroplane can carry a maximum of 200 passengers. A profit of ₹1000 is made on each executive class ticket and a profit of ₹600 is made on each economy class ticket. The airline reserves atleast 20 seats for executive class. However, atleast 4 times as many passengers prefer to travel by economy class than by the executive class. Determine how many tickets of each type must be sold in order to maximise the profit of the airline. What is the maximum profit?
A medical company has factories at two places, A and B. From these places, supply is made to each of its three agencies situated at P, Q and R. The monthly requirements of the agencies are respectively 40, 40 and 50 packets of the medicines, while the production capacity of the factories, A and B, are 60 and 70 packets respectively. The transportation cost per packet from the factories to the agencies are given below:
| Transportation Cost per packet(in Rs.) | ||
| From-> | A | B |
| To | ||
| P | 5 | 4 |
| Q | 4 | 2 |
| R | 3 | 5 |
A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type A
require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours and 20 minutes available for cutting and 4 hours available for assembling. The profit is Rs. 50 each for type A and Rs. 60 each for type B souvenirs. How many souvenirs of each type should the company manufacture in order to maximize profit? Formulate the above LPP and solve it graphically and also find the maximum profit.
A company manufactures two types of cardigans: type A and type B. It costs ₹ 360 to make a type A cardigan and ₹ 120 to make a type B cardigan. The company can make at most 300 cardigans and spend at most ₹ 72000 a day. The number of cardigans of type B cannot exceed the number of cardigans of type A by more than 200. The company makes a profit of ₹ 100 for each cardigan of type A and ₹ 50 for every cardigan of type B.
Formulate this problem as a linear programming problem to maximize the profit to the company. Solve it graphically and find the maximum profit.
Find the solution set of inequalities 0 ≤ x ≤ 5, 0 ≤ 2y ≤ 7
The minimum value of z = 2x + 9y subject to constraints x + y ≥ 1, 2x + 3y ≤ 6, x ≥ 0, y ≥ 0 is ______.
For the function z = 19x + 9y to be maximum under the constraints 2x + 3y ≤ 134, x + 5y ≤ 200, x ≥ 0, y ≥ 0; the values of x and y are ______.
Maximise and Minimise Z = 3x – 4y subject to x – 2y ≤ 0, – 3x + y ≤ 4, x – y ≤ 6, x, y ≥ 0
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 ____________.
In Corner point method for solving a linear programming problem the first step is to ____________.
The feasible region (shaded) for a L.P.P is shown in the figure. The maximum Z = 5x + 7y is ____________.
The solution set of the inequality 3x + 5y < 4 is ______.
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.
