Advertisements
Advertisements
प्रश्न
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?
उत्तर
Let the dietician wishes to mix x units of food A and y units of food B.
Therefore,
| Thiamine(mg) | Calories | |
| Food A | 0.12 | 100 |
| Food B | 0.1 | 150 |
| Minimum requirement | 0.5 | 600 |
According to the question,
The constraints are
\[0 . 12x + 0 . 1y \geq 0 . 5\]
\[100x + 150y \geq 600\]
It is given that each food costs 10 paise per units
Therefore,
Total cost, Z = \[10x + 10y\]
Thus, the mathematical formulation of the given linear programmimg problem is
\[0 . 12x + 0 . 1y \geq 0 . 5\]
\[100x + 150y \geq 600\]
Region represented by 0.12x +0.1y ≥ 0.5:
The line 0.12x + 0.6y = 20 meets the coordinate axes at\[A_1 \left( \frac{25}{6}, 0 \right)\] and \[B_1 \left( 0, 5 \right)\]respectively. By joining these points we obtain the line 0.12x + 0.6y = 20.Clearly (0,0) does not satisfies the 0.12x + 0.6y = 20. So,the region which does not contains the origin represents the solution set of the inequation 0.12x+0.1y ≥ 0.5.
Region represented by 100x + 150y ≥ 600:
The line 100x + 150y = 600 meets the coordinate axes at\[C_1 \left( 6, 0 \right)\] and \[D_1 \left( 0, 4 \right)\] respectively. By joining these points we obtain the line 100x + 150y = 600. Clearly (0,0) does not satisfies the inequation 100x + 150y ≥ 600. So,the region which does not contains the origin represents the solution set of the inequation 100x + 150y ≥ 600.
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 0.12x +0.1y ≥ 0.5, 100x + 150y ≥ 600, x ≥ 0, and y ≥ 0 are as follows.
The corner points are B1(0, 5),
| Corner point | Z= 10x +10y |
| B1 | 50 |
| E1 | 46.2 |
| C1 | 60 |
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
A retired person wants to invest an amount of Rs. 50, 000. His broker recommends investing in two type of bonds ‘A’ and ‘B’ yielding 10% and 9% return respectively on the invested amount. He decides to invest at least Rs. 20,000 in bond ‘A’ and at least Rs. 10,000 in bond ‘B’. He also wants to invest at least as much in bond ‘A’ as in bond ‘B’. Solve this linear programming problem graphically to maximise his returns.
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:
Minimise Z = 5x + 10y
Subject to x + 2y ≤ 120
Constraints x + y ≥ 60
x – 2y ≥ 0 and x, y ≥ 0
Solve the following L.P.P. graphically Maximise Z = 4x + y
Subject to following constraints x + y ≤ 50
3x + y ≤ 90,
x ≥ 10
x, y ≥ 0
In order to supplement daily diet, a person wishes to take X and Y tablets. The contents (in milligrams per tablet) of iron, calcium and vitamins in X and Y are given as below :
| Tablets | Iron | Calcium | Vitamin |
| x | 6 | 3 | 2 |
| y | 2 | 3 | 4 |
The person needs to supplement at least 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamins. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each type should the person take in order to satisfy the above requirement at the minimum cost? Make an LPP and solve graphically.
Maximize Z = 50x + 30y
Subject to
\[2x + y \leq 18\]
\[3x + 2y \leq 34\]
\[ x, y \geq 0\]
Maximize Z = 15x + 10y
Subject to
\[3x + 2y \leq 80\]
\[2x + 3y \leq 70\]
\[ x, y \geq 0\]
Minimize Z = 30x + 20y
Subject to
\[x + y \leq 8\]
\[ x + 4y \geq 12\]
\[5x + 8y = 20\]
\[ 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 = 3x1 + 4x2, if possible,
Subject to the constraints
\[x_1 - x_2 \leq - 1\]
\[ - x_1 + x_2 \leq 0\]
\[ x_1 , x_2 \geq 0\]
To maintain one's health, a person must fulfil certain minimum daily requirements for the following three nutrients: calcium, protein and calories. The diet consists of only items I and II whose prices and nutrient contents are shown below:
| Food I | Food II | Minimum daily requirement | |
| Calcium Protein Calories |
10 5 2 |
4 6 6 |
20 20 12 |
| Price | Rs 0.60 per unit | Rs 1.00 per unit |
Find the combination of food items so that the cost may be minimum.
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
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 dietician wishes to mix together 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 and 8 units of vitamin C. The vitamin contents of one kg food is given below:
| Food | Vitamin A | Vitamin B | Vitamin C |
| X | 1 | 2 | 3 |
| Y | 2 | 2 | 1 |
One kg of food X costs ₹16 and one kg of food Y costs ₹20. Find the least cost of the mixture which will produce the required diet?
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 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 20 minutes available for cutting and 4 hours available for assembling. The profit is 50 paise each for type A and 60 paise each for type B souvenirs. How many souvenirs of each type should the company manufacture in order to maximize the profit?
A manufacturer of patent medicines is preparing a production plan on medicines, A and B. There are sufficient raw materials available to make 20000 bottles of A and 40000 bottles of B, but there are only 45000 bottles into which either of the medicines can be put. Further, it takes 3 hours to prepare enough material to fill 1000 bottles of A, it takes 1 hour to prepare enough material to fill 1000 bottles of B and there are 66 hours available for this operation. The profit is Rs 8 per bottle for A and Rs 7 per bottle for B. How should the manufacturer schedule his production in order to maximize his 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 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.
A company sells two different products, A and B. The two products are produced in a common production process, which has a total capacity of 500 man-hours. It takes 5 hours to produce a unit of A and 3 hours to produce a unit of B. The market has been surveyed and company officials feel that the maximum number of unit of A that can be sold is 70 and that for B is 125. If the profit is Rs 20 per unit for the product A and Rs 15 per unit for the product B, how many units of each product should be sold to maximize profit?
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 makes two types of toys A and B. Three machines are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:
| Types of Toys | Machines | ||
| I | II | III | |
| A | 12 | 18 | 6 |
| B | 6 | 0 | 9 |
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 manufacturer has employed 5 skilled men and 10 semi-skilled men and makes two models A and B of an article. The making of one item of model A requires 2 hours of work by a skilled man and 2 hours work by a semi-skilled man. One item of model B requires 1 hour by a skilled man and 3 hours by a semi-skilled man. No man is expected to work more than 8 hours per day. The manufacturer's profit on an item of model A is ₹ 15 and on an item of model B is ₹ 10. How many items of each model should be made per day in order to maximize daily profit? Formulate the above LPP and solve it graphically and find the maximum profit.
Sketch the graph of inequation x ≥ 5y in xoy co-ordinate system
The maximum value of z = 3x + 10y subjected to the conditions 5x + 2y ≤ 10, 3x + 5y ≤ 15, x, 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 ______
A feasible region in the set of points which satisfy ____________.
Of all the points of the feasible region for maximum or minimum of objective function the points.
Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints described by linear inequalities,
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.
Find feasible solution for the following system of linear inequation graphically.
3x + 4y ≥ 12, 4x + 7y ≤ 28, x ≥ 0, y ≥ 0
