Advertisements
Advertisements
प्रश्न
A company produces two types of products say type A and B. Profits on the two types of product are ₹ 30/- and ₹ 40/- per kg respectively. The data on resources required and availability of resources are given below.
| Requirements | Capacity available per month | ||
| Product A | Product B | ||
| Raw material (kgs) | 60 | 120 | 12000 |
| Machining hours/piece | 8 | 5 | 600 |
| Assembling (man hours) | 3 | 4 | 500 |
Formulate this problem as a linear programming problem to maximize the profit.
Advertisements
उत्तर
(i) Variables: Let x1 and x2 denote the two types products A and B respectively.
(ii) Objective function:
Profit on x1 units of type A product = 30x1
Profit on x2 units of type B product = 40x2
Total profit = 30x1 + 40x2
Let Z = 30x1 + 40x2, which is the objective function.
Since the profit is to be maximized, we have to maximize Z = 30x1 + 40x2
(iii) Constraints:
60x1 + 120x2 ≤ 12,000
8x1 + 5x2 ≤ 600
3x1 + 4x2 ≤ 500
(iv) Non-negative constraints: Since the number of products on type A and type B are non-negative, we have x1, x2 ≥ 0
Thus, the mathematical formulation of the LPP is Maximize Z = 30x1 + 40x2
Subject to the constraints,
60x1 + 120x2 ≤ 12,000
8x1 + 5x2 ≤ 600
3x1 + 4x2 ≤ 500
x1, x2 ≥ 0
APPEARS IN
संबंधित प्रश्न
If the corner points of the feasible solution are (0, 0), (3, 0), (2, 1), `(0, 7/3)` the maximum value of z = 4x + 5y is ______.
A chemical company produces a chemical containing three basic elements A, B, C, so that it has at least 16 litres of A, 24 litres of B and 18 litres of C. This chemical is made by mixing two compounds I and II. Each unit of compound I has 4 litres of A, 12 litres of B and 2 litres of C. Each unit of compound II has 2 litres of A, 2 litres of B and 6 litres of C. The cost per unit of compound I is ₹ 800 and that of compound II is ₹ 640. Formulate the problems as LPP and solve it to minimize the cost.
A manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry and then sent to machine shop for finishing. The number of man hours of labour required in each shop for production of A and B and the number of man hours available for the firm are as follows:
| Gadgets | Foundry | Machine Shop |
| A | 10 | 5 |
| B | 6 | 4 |
| Time available (hours) | 60 | 35 |
Profit on the sale of A is ₹ 30 and B is ₹ 20 per unit. Formulate the L.P.P. to have maximum profit.
Choose the correct alternative :
Feasible region; the set of points which satify.
Choose the correct alternative :
The half plane represented by 3x + 2y ≤ 0 constraints the point.
State whether the following is True or False :
Saina wants to invest at most ₹ 24000 in bonds and fixed deposits. Mathematically this constraints is written as x + y ≤ 24000 where x is investment in bond and y is in fixed deposits.
Maximize z = 7x + 11y subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0
Solve the following linear programming problems by graphical method.
Maximize Z = 20x1 + 30x2 subject to constraints 3x1 + 3x2 ≤ 36; 5x1 + 2x2 ≤ 50; 2x1 + 6x2 ≤ 60 and x1, x2 ≥ 0.
Solution which satisfy all constraints is called ______ solution.
The maximum value of Z = 9x + 13y subject to constraints 2x + 3y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0 is ______.
