Advertisements
Advertisements
प्रश्न
A farmer has a 100 acre farm. He can sell the tomatoes, lettuce, or radishes he can raise. The price he can obtain is Rs 1 per kilogram for tomatoes, Rs 0.75 a head for lettuce and Rs 2 per kilogram for radishes. The average yield per acre is 2000 kgs for radishes, 3000 heads of lettuce and 1000 kilograms of radishes. Fertilizer is available at Rs 0.50 per kg and the amount required per acre is 100 kgs each for tomatoes and lettuce and 50 kilograms for radishes. Labour required for sowing, cultivating and harvesting per acre is 5 man-days for tomatoes and radishes and 6 man-days for lettuce. A total of 400 man-days of labour are available at Rs 20 per man-day. Formulate this problem as a LPP to maximize the farmer's total profit.
Advertisements
उत्तर
Let the farmer sow tomatoes in x acres, lettuce in y acres & radishes in z acres of the farm.
Average yield per acre is 2000 kgs for tomatoes, 3000 kgs of lettuce and 1000 kg of radishes.
Thus, the farmer raised 2000x kg of tomatoes, 3000y kg of lettuce and 1000z kg of radishes.
Given, price he can obtain is Re 1 per kilogram for tomatoes, Re 0.75 a head for lettuce and Rs 2 per kilogram for radishes.
∴ Selling price = Rs \[\left[ 2000x\left( 1 \right) + 3000y\left( 0 . 75 \right) + 1000z\left( 2 \right) \right]\] = Rs (2000x + 2250y + 2000z)
Labour required for sowing, cultvating and harvesting per acre is 5 man-days for tomatoes and radishes and 6 man-days for lettuce.Therefore, labour required for sowing, cultivating and harvesting per acre is 5x for tomatoes, 6y for lettuce and 5z for radishes.
Number of man-days required in sowing, cultivating and harvesting= \[5x + 6y + 5z\] Price of one man-day = Rs 20
Therefore, fertilizer required is 100x kgs for the tomatoes sown in x acres, 100y kgs for the lettuce sown in y acres and 50z kgs for radishes sown in z acres of land.
Hence, total fertilizer used= (100x + 100y +50z) kgs
Thus, fertilizer's cost =
= Rs
= Rs\[\left( 1850x + 2080y + 1875z \right)\]
Let Z denotes the total profit
Total area of the farm = 100 acres
Also, it is given that the total man-days available are 400.
Thus, \[5x + 6y + 5z \leq 400\]
Area of the land cannot be negative.
Therefore, \[x, y \geq 0\]
Hence, the required LPP is as follows:
Maximize \[Z = 1850x + 2080y + 1875z\]
\[x + y + z \leq 100\]
\[ 5x + 6y + 5z \leq 400\]
\[x, y, z \geq 0\]
APPEARS IN
संबंधित प्रश्न
The postmaster of a local post office wishes to hire extra helpers during the Deepawali season, because of a large increase in the volume of mail handling and delivery. Because of the limited office space and the budgetary conditions, the number of temporary helpers must not exceed 10. According to past experience, a man can handle 300 letters and 80 packages per day, on the average, and a woman can handle 400 letters and 50 packets per day. The postmaster believes that the daily volume of extra mail and packages will be no less than 3400 and 680 respectively. A man receives Rs 225 a day and a woman receives Rs 200 a day. How many men and women helpers should be hired to keep the pay-roll at a minimum ? Formulate an LPP and solve it graphically.
A company produces two types of goods A and B, that require gold and silver. Each unit of type A requires 3 g of silver and 1 g of golds while that of type B requires 1 g of silver and 2 g of gold. The company can procure a maximum of 9 g of silver and 8 g of gold. If each unit of type A brings a profit of Rs 40 and that of type B Rs 50, formulate LPP to maximize profit.
A small manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry, then sent to the machine shop for finishing. The number of man-hours of labour required in each shop for the production of each unit of A and B, and the number of man-hours the firm has available per week are as follows:
| Gadget | Foundry | Machine-shop |
| A | 10 | 5 |
| B | 6 | 4 |
| Firm's capacity per week | 1000 | 600 |
The profit on the sale of A is Rs 30 per unit as compared with Rs 20 per unit of B. The problem is to determine the weekly production of gadgets A and B, so that the total profit is maximized. Formulate this problem as a LPP.
A firm manufactures 3 products A, B and C. The profits are Rs 3, Rs 2 and Rs 4 respectively. The firm has 2 machines and below is the required processing time in minutes for each machine on each product :
| Machine | Products | ||
| A | B | C | |
| M1 M2 |
4 | 3 | 5 |
| 2 | 2 | 4 | |
Machines M1 and M2 have 2000 and 2500 machine minutes respectively. The firm must manufacture 100 A's, 200 B's and 50 C's but not more than 150 A's. Set up a LPP to maximize the profit.
The corner points of the feasible region determined by the following system of linear inequalities:
2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let Z = px + qy, where p, q > 0. Condition on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is
Solve the following LPP by graphical method:
Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0
Solve the following L.P.P. by graphical method :
Maximize : Z = 7x + 11y subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
Solve the following L.P.P. by graphical method:
Minimize: Z = 6x + 2y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0.
Fill in the blank :
Graphical solution set of the in equations x ≥ 0, y ≥ 0 is in _______ quadrant
Fill in the blank :
The region represented by the in equations x ≤ 0, y ≤ 0 lines in _______ quadrants.
The constraint that a factory has to employ more women (y) than men (x) is given by _______
Graphical solution set of x ≤ 0, y ≥ 0 in xy system lies in second quadrant.
Solve the following problem :
Maximize Z = 5x1 + 6x2 Subject to 2x1 + 3x2 ≤ 18, 2x1 + x2 ≤ 12, x ≥ 0, x2 ≥ 0
Solve the following problem :
Minimize Z = 4x + 2y Subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0, y ≥ 0
Solve the following problem :
Minimize Z = 2x + 3y Subject to x – y ≤ 1, x + y ≥ 3, x ≥ 0, y ≥ 0
Solve the following problem:
Maximize Z = 4x1 + 3x2 Subject to 3x1 + x2 ≤ 15, 3x1 + 4x2 ≤ 24, x1 ≥ 0, x2 ≥ 0
Maximize Z = 60x + 50y Subject to x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0
A carpenter makes chairs and tables, profits are ₹ 140 per chair and ₹ 210 per table. Both products are processed on three machines, Assembling, Finishing and Polishing. The time required for each product in hours and the availability of each machine is given by the following table.
| Product/Machines | Chair (x) |
Table (y) |
Available time (hours) |
| Assembling | 3 | 3 | 36 |
| Finishing | 5 | 2 | 50 |
| Polishing | 2 | 6 | 60 |
Formulate and solve the following Linear programming problems using graphical method.
Solve the following problem :
A factory produced two types of chemicals A and B The following table gives the units of ingredients P & Q (per kg) of Chemicals A and B as well as minimum requirements of P and Q and also cost per kg. of chemicals A and B.
| Ingredients per kg. /Chemical Units | A (x) |
B (y) |
Minimum requirements in |
| P | 1 | 2 | 80 |
| Q | 3 | 1 | 75 |
| Cost (in ₹) | 4 | 6 |
Find the number of units of chemicals A and B should be produced so as to minimize the cost.
Solve the following problem :
A person makes two types of gift items A and B requiring the services of a cutter and a finisher. Gift item A requires 4 hours of cutter's time and 2 hours of finisher's time. B requires 2 hours of cutters time, 4 hours of finishers time. The cutter and finisher have 208 hours and 152 hours available times respectively every month. The profit of one gift item of type A is ₹ 75 and on gift item B is ₹ 125. Assuming that the person can sell all the items produced, determine how many gift items of each type should be make every month to obtain the best returns?
Choose the correct alternative:
If LPP has optimal solution at two point, then
Choose the correct alternative:
The maximum value of Z = 3x + 5y subjected to the constraints x + y ≤ 2, 4x + 3y ≤ 12, x ≥ 0, y ≥ 0 is
Choose the correct alternative:
The point at which the minimum value of Z = 8x + 12y subject to the constraints 2x + y ≥ 8, x + 2y ≥ 10, x ≥ 0, y ≥ 0 is obtained at the point
State whether the following statement is True or False:
If LPP has two optimal solutions, then the LPP has infinitely many solutions
State whether the following statement is True or False:
A convex set includes the points but not the segment joining the points
State whether the following statement is True or False:
If the corner points of the feasible region are (0, 10), (2, 2) and (4, 0), then the minimum value of Z = 3x + 2y is at (4, 0)
State whether the following statement is True or False:
The graphical solution set of the inequations 0 ≤ y, x ≥ 0 lies in second quadrant
A set of values of variables satisfying all the constraints of LPP is known as ______
A dealer deals in two products X and Y. He has ₹ 1,00,000/- to invest and space to store 80 pieces. Product X costs ₹ 2500/- and product Y costs ₹ 1000/- per unit. He can sell the items X and Y at respective profits of ₹ 300 and ₹ 90. Construct the LPP and find the number of units of each product to be purchased to maximize its profit
A chemist has a compound to be made using 3 basic elements X, Y, Z so that it has at least 10 litres of X, 12 litres of Y and 20 litres of Z. He makes this compound by mixing two compounds (I) and (II). Each unit compound (I) had 4 litres of X, 3 litres of Y. Each unit compound (II) had 1 litre of X, 2 litres of Y and 4 litres of Z. The unit costs of compounds (I) and (II) are ₹ 400 and ₹ 600 respectively. Find the number of units of each compound to be produced so as to minimize the cost
A wholesale dealer deals in two kinds of mixtures A and B of nuts. Each kg of mixture A contains 60 grams of almonds, 30 grams of cashew and 30 grams of hazel nuts. Each kg of mixture B contains 30 grams of almonds, 60 grams of cashew and 180 grams of hazel nuts. A 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 and 540 grams of hazel nuts. Mixture A costs ₹ 8 and B costs ₹ 12 per kg. How many kgs of each mixture should he use to minimize the cost of the kgs
Minimize Z = x + 4y subject to constraints
x + 3y ≥ 3, 2x + y ≥ 2, x ≥ 0, y ≥ 0
Minimize Z = 2x + 3y subject to constraints
x + y ≥ 6, 2x + y ≥ 7, x + 4y ≥ 8, x ≥ 0, y ≥ 0
Amartya wants to invest ₹ 45,000 in Indira Vikas Patra (IVP) and in Public Provident fund (PPF). He wants to invest at least ₹ 10,000 in PPF and at least ₹ 5000 in IVP. If the rate of interest on PPF is 8% per annum and that on IVP is 7% per annum. Formulate the above problem as LPP to determine maximum yearly income.
Solution: Let x be the amount (in ₹) invested in IVP and y be the amount (in ₹) invested in PPF.
x ≥ 0, y ≥ 0
As per the given condition, x + y ______ 45000
He wants to invest at least ₹ 10,000 in PPF.
∴ y ______ 10000
Amartya wants to invest at least ₹ 5000 in IVP.
∴ x ______ 5000
Total interest (Z) = ______
The formulated LPP is
Maximize Z = ______ subject to
______
Solve the following LPP graphically:
Maximize Z = 9x + 13y subject to constraints
2x + 3y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0
Solution: Convert the constraints into equations and find the intercept made by each one of it.
| Inequation | Equation | X intercept | Y intercept | Region |
| 2x + 3y ≤ 18 | 2x + 3y = 18 | (9, 0) | (0, ___) | Towards origin |
| 2x + y ≤ 10 | 2x + y = 10 | ( ___, 0) | (0, 10) | Towards origin |
| x ≥ 0, y ≥ 0 | x = 0, y = 0 | X axis | Y axis | ______ |
The feasible region is OAPC, where O(0, 0), A(0, 6),
P( ___, ___ ), C(5, 0)
The optimal solution is in the following table:
| Point | Coordinates | Z = 9x + 13y | Values | Remark |
| O | (0, 0) | 9(0) + 13(0) | 0 | |
| A | (0, 6) | 9(0) + 13(6) | ______ | |
| P | ( ___,___ ) | 9( ___ ) + 13( ___ ) | ______ | ______ |
| C | (5, 0) | 9(5) + 13(0) | ______ |
∴ Z is maximum at __( ___, ___ ) with the value ___.
A linear function z = ax + by, where a and b are constants, which has to be maximised or minimised according to a set of given condition is called a:-
