Advertisements
Advertisements
प्रश्न
Solve the following L.P.P. graphically Minimize Z = 3x + 5y Subject to 2x + 3y ≥ 12
-x + y ≤ 3
x ≤ 4
y ≥ 3
उत्तर
| Inequation | Equation | Points on line |
| 2x + 3y ≥12 | 2x + 3y = 12 | (0,4),(6, 0) |
| - x + y ≤ 3 | - x+ y = 3 | (0,3), (-3,0) |
| x ≤ 4 | x = 4 | |
| y ≥ 3 | y = 3 |
Requjred region is bounded region ABCDA Co-ordinates of corner points are
A = (1,5,3) B = (4, 3)
C = (4, 7) D = (0.6, 3.6)
Corner points Z = 3x + 5y
At A(1 ,5, 3) Z = 3 (1.5) + 5 (3)
= 4.5 + 15 = 19.5
At B(4. 3) Z = 3(4) + 5(3)
= 12 + 15 = 27
At C(4, 7) Z = 3 (4 ) + 5 (7)
= 12 + 35 = 47
At D(0.6, 3.6) Z = 3 (0.6) + 5 (3.6)
= ·1.8 + 18 = 19.8
From the above data ·
Minimum value of Z is 19.5 at point A ( 1.5, 3)
Solution of L.P.P. is X = 1.5, Y = 3, `Z_min` = 19.5
Notes
≥
≤
APPEARS IN
संबंधित प्रश्न
Electro Corp. Co. manufactures two electrical products :Air conditioners and Fans. The assembly process for each is similar in which both require a certain amount of wiring and drilling. Each air conditioner takes 4 hours for wiring and 2 hours for drilling. Each fan also takes 2 hours for wiring and 1 hour for drilling. During the next production period, 240 hours of wiring time are available and upto 100 hours of drilling time may be used. Each air-conditioner assembled may be sold for Rs. 2,000 profit and each fan assembled may be sold for Rs. 1,000 profit. Formulate this problem as an L.P.P. in order to maximize the profit.
Find graphical solution for the following system of linear inequations:
2x + 3y ≥ 2, -x + y ≤ 3, x ≤ 4, y ≥ 3
Solve the following using graphical method :
Minimize :Z=3x+5y
`2x+3x>=12`
`-x+y<=3`
`x<=4,y>=3,x>=0,y>=0`
There are found jobs to be completed. Each job must go through machines M1 , M2 , M3 in the order M1 - M2 - M3. Processing time in hours is given below. Determine the optimal sequesnce and idle time for machine M1 .
| Jobs | A | B | C | D |
| M1 | 5 | 8 | 7 | 3 |
| M2 | 6 | 7 | 2 | 5 |
| M3 | 7 | 8 | 10 | 9 |
Compute CDR using the information given below :
| Age group ( Years ) |
0-15 | 15-35 | 35-65 | 65 and above |
| Population | 9000 | 25000 | 32000 | 9000 |
Total number of deaths in a year is given to be 900.
Calculate the CDR for District A and B and compare them:
| Age group (in years) | District A | District B | ||
| No.of. persons (in '000) |
No.of. deaths |
No.of. persons (in '000) |
No.of. deaths | |
| 0 - 15 | 1 | 20 | 2 | 50 |
| 15 - 60 | 3 | 30 | 7 | 70 |
| 60 and above | 2 | 40 | 1 | 25 |
Diet for a sick person must contain at least 4000 units of vitamins, 50 units of minerals and 1500 calories Two foods F1 and F2 cost Rs. 50 and Rs. 75 per unit respectively. Each unit of food F1 contains 200 units of vitamins, 1 unit of minerals and 40 calories, whereas each unit of food F2 contains 100 units of vitamins, 2 units of minerals and 30 calories. Formulate the above problem as L.P.P. to satisfy the sick person's requirements at minimum cost.
Minimize: Z = 2x + y
Subject to: x + y ≤ 5
x + 2y ≤ 8
4x + 3y ≥ 12
x ≥ o, y ≥ o
Solve graphically.
Find the graphical solution for the following system of linear equations :
3x + 4y ≥ 12 , 4x + 7y ≤ 28 , y ≥ 1 , x ≥ 0 , y ≥ 0 ,
Hence find the co-ordinates of comer points of the common region.
Find the graphical solution for following system of linear inequations
`"x"_1/60 + "x"_2/90 <= 1 ; 5x_1 + 8x_2 ≤ 600 , x_1 ≥ 0 , x_2 ≥ 0`
Minimize : Z = 3x1 + 2x2
Subject to constraints
5x1 + x2 ≥ 10
2x1 + 2x2 ≥ 12
x1 + 4x2 ≥ 12
x1 , x2 ≥ 0
Solve the following L.P.P.:
Maximize Z = 4x + 5y
subject to 2x + y ≥ 4
x + y ≤ 5,
0 ≤ x ≤ 3,
0 ≤ y ≤ 3
Mr. Rajesh has ₹ 1800 to spend on fruits for a meeting. Grapes cost ₹ 160/kg llnd peaches ₹ 200/kg. Let x and g represent the number of kilogrames of grapes and peaches he can buy. Write the graph of an inequation to model the amounts of grapes and peaches he can buy within his budget.
Find common region for the following system of linear inequations :
x ≥ -3, 4x - 5y ≥ -20, 3x + 4y ≤ 12, y ≥ -2
Solve the following L.P.P. :
Minimize : Z = 4x + 10y,
Subject to : 2x + 5y ≤10 , 5x + 3y ≤ 15,
x + 2y ≥ 30, x ≥ 0, y ≥ 0.
