A manufacture produceds two types of steel trunks. He has two machines, A and B. The first type of book case requires 3 hours on machine A and 3 hours on machine B for completion whereas the second type required 3 hours on machine A and 2 hours n machine B. Machines A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of Rs.30 and Rs.25 per trunk of the first type and second type respectively. How many trunks of each type must he make each day to make the maximum profit?

A manufacture produceds two types of steel trunks. He has two machines

1.	A manufacture produceds two types of steel trunks. He has two machines, A and B. The first type of book case requires 3 hours on machine A and 3 hours on machine B for completion whereas the second type required 3 hours on machine A and 2 hours n machine B. Machines A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of Rs.30 and Rs.25 per trunk of the first type and second type respectively. How many trunks of each type must he make each day to make the maximum profit?
Answer» Correct Answer - For getting a maximum profit of Rs. 165, 3 trunks of each type should be manufactured. Let x trunks of the first type and y rrunks of the second type be manufactured. Then, `3x+3yle18, 3x+2yle15, xge0andyge0.` Maximize `Z=30x+25y.`

Discussion

No Comment Found

Related InterviewSolutions

Objective function of an LPP isA. a constraintB. a function to be optimisedC. a relation between the variableD. feasible region
The objective function off LPP defined over the convex set attains it optimum value atA. at least two of the corner pointsB. all the corner pointsC. at least one of the corner pointsD. none of the corner points
Feasible region is represented by A. `2x+5yge80,x+yle20,xge0,yge0`B. `2x+5yle80,x+yge20,xge0,yge0`C. `2x+5yge80,x+yge20,xge0,yge0`D. `2x+5yle80,x+yle20,xge0,yge0`
The feasible solution of a LPP belongs toA. first and secondB. first and thirdC. only secondD. only first
The vertices of a closed- convex polygon representing the feasible region of the objective function f are (5,1) (3,5) (4,3) and (2,5) . Find the maximum value of the function f=8x+9y.A. 61B. 69C. 59D. 49
The maximum or minimum of the objective funtion occurs only at the corner points of the feasible region. This theorem is known as fundamental theorem ofA. AlgebraB. ArithmeticC. CalculusD. Extreme point
Region represented by the inequalities `xge0,yge0` isA. first quadrantB. second quadrantC. third quadrantD. fourth quadrant
The objective function `z=2x+4y` subject to `2x+yge3,x+2yge6,xge0yge0` can be minimizedA. at infinite number of pointsB. at two points onlyC. at one points onlyD. at three points only
In a mid-day meal porogramme, an NGO wants to provide vitamin-rich diet to the students of an MCD school. The dietician of the NGO wishes to mix two types of dood in such a way that vitamin contents of the mixture contains at least 8 units of vitamin A and 10 units of vitamin C. Food 1 contains 2 units per kg of vitamin A and 1 unit per kg of vitamin C. Food 2 contains 1 units per kg of vitamin A and 2 units per kg of vitamin C. It costs Rs.50 per kg to purchase Food 1 and Rs.70 per kg to purchase Food 2. Formulate the problems as LPP and solve it graphically for the imnimum cost of such a mixture ?
The minimum value of `z=6x+21y` subject to `x+2yge3,x+4yge4,3x+yge3,xge0,yge0` isA. 20.5B. 28.8C. 24D. 22.5

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment