Advertisements
Advertisements
प्रश्न
A factory owner purchases two types of machines, A and B, for his factory. The requirements and limitations for the machines are as follows:
| Area occupied by the machine |
Labour force for each machine |
Daily output in units |
|
| Machine A Machine B |
1000 sq. m 1200 sq. m |
12 men 8 men |
60 40 |
He has an area of 7600 sq. m available and 72 skilled men who can operate the machines.
How many machines of each type should he buy to maximize the daily output?
Advertisements
उत्तर
Let x machines of type A and y machines of type B were purchased.
Number of machines cannot be negative.
Therefore,
\[x, y \geq 0\]
We are given,
| Area occupied by the machine |
Labour force for each machine |
Daily output in units |
|
| Machine A Machine B |
1000 sq. m 1200 sq. m |
12 men 8 men |
60 40 |
The area of 7600 sq m is available and there are 72 skilled men available to operate the machines.
Therefore, the constraints are
\[1000x + 1200y \leq 7600\]
\[\text{ and } 12x + 8y \leq 72\]
Total daily output = Z = \[60x + 40y\]\
which is to be maximised.
Thus, the mathematical formulation of the given linear programming problem is
Max Z = \[60x + 40y\]
subject to
\[1000x + 1200y \leq 7600\]
\[12x + 8y \leq 72\]
First we will convert inequations into equations as follows :
1000x + 1200y = 7600, 12x + 8y = 72, x = 0 and y = 0
Region represented by 1000x + 1200y ≤ 7600:
The line 1000x + 1200y = 7600 meets the coordinate axes at \[A_1 \left( \frac{38}{5}, 0 \right)\] and \[B_1 \left( 0, \frac{19}{3} \right)\] respectively. By joining these points we obtain the line
1000x + 1200y = 7600. Clearly (0,0) satisfies the 1000x + 1200y = 7600. So, the region which contains the origin represents the solution set of the inequation 1000x + 1200y ≤ 7600.
Region represented by 12x + 8y ≤ 72:
The line 12x + 8y = 72 meets the coordinate axes at C1(6, 0) and D1(0, 9) respectively. By joining these points we obtain the line 12x + 8y = 72 .Clearly (0,0) satisfies the inequation 12x + 8y ≤ 72. So,the region which contains the origin represents the solution set of the inequation 12x + 8y ≤ 72.
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 1000x + 1200y ≤ 7600, 12x+ 8y ≤ 72, x ≥ 0, and y ≥ 0 are as follows.
The corner points are O(0, 0)
| Corner point | Z= 60x + 40y |
| O | 0 |
| B1 | 253.3 |
| E1 | 360 |
| C1 | 360 |
The maximum value of Z is 360 which is attained at E1(4, 3) and C1(6, 0).
Thus, the maximum output is Rs 360 obtained when 4 units of type A and 3 units of type B or 6 units of type A are manufactured.
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
Find graphically, the maximum value of z = 2x + 5y, subject to constraints given below :
2x + 4y ≤ 83
x + y ≤ 6
x + y ≤ 4
x ≥ 0, y≥ 0
Solve the following LPP by graphical method:
Maximize: z = 3x + 5y
Subject to: x + 4y ≤ 24
3x + y ≤ 21
x + y ≤ 9
x ≥ 0, y ≥ 0
Also find the maximum value of z.
Solve the following L. P. P. graphically:Linear Programming
Minimize Z = 6x + 2y
Subject to
5x + 9y ≤ 90
x + y ≥ 4
y ≤ 8
x ≥ 0, y ≥ 0
Maximize Z = 5x + 3y
Subject to
\[3x + 5y \leq 15\]
\[5x + 2y \leq 10\]
\[ x, y \geq 0\]
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\]
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.
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 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 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 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?
If a young man drives his vehicle at 25 km/hr, he has to spend Rs 2 per km on petrol. If he drives it at a faster speed of 40 km/hr, the petrol cost increases to Rs 5/per km. He has Rs 100 to spend on petrol and travel within one hour. Express this as an LPP and solve the same.
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 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 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. If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the number of tennis rackets and cricket bats that the factory must manufacture to earn the maximum profit. Make it as an LPP and solve it graphically.
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 point at which the maximum value of x + y subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x ≥ 0, y ≥ 0 is obtained, is ______.
From the details given below, calculate the five-year moving averages of the number of students who have studied in a school. Also, plot these and original data on the same graph paper.
| Year | 1993 | 1994 | 1995 | 1996 | 1997 | 1998 | 1999 | 2000 | 2001 | 2002 |
| Number of Students | 332 | 317 | 357 | 392 | 402 | 405 | 410 | 427 | 405 | 438 |
Find the graphical solution for the system of linear inequation 2x + y ≤ 2, x − y ≤ 1
For the LPP, maximize z = x + 4y subject to the constraints x + 2y ≤ 2, x + 2y ≥ 8, x, y ≥ 0 ______.
The minimum value of z = 7x + 9y subject to 3x + y ≤ 6, 5x + 8y ≤ 40, x ≥ 0, y ≥ 2 is ______.
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,
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 ____________.
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 the objective function Z has both a maximum and a minimum value on R and ____________.
The feasible region (shaded) for a L.P.P is shown in the figure. The maximum Z = 5x + 7y is ____________.
Minimise z = – 3x + 4y subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0 What will be the minimum value of z ?
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 ______.
The maximum value of z = 5x + 2y, subject to the constraints x + y ≤ 7, x + 2y ≤ 10, x, y ≥ 0 is ______.
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.
Solve the following Linear Programming Problem graphically.
Maximise Z = 5x + 2y subject to:
x – 2y ≤ 2,
3x + 2y ≤ 12,
– 3x + 2y ≤ 3,
x ≥ 0, 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 solution set of constraints x + 2y ≥ 11, 3x + 4y ≤ 30, 2x + 5y ≤ 30 and x ≥ 0, y ≥ 0, includes the point ______.
For \[x+y\leq50\], \[3x+y\leq90\], \[x\geq0\], and \[y\geq0\], which is a corner point of the feasible region?
