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
संबंधित प्रश्न
The maximum value of z = 5x + 3y subject to the constraints 3x + 5y ≤ 15, 5x + 2y ≤ 10, x, y ≥ 0 is ______.
In a cattle breeding firm, it is prescribed that the food ration for one animal must contain 14, 22, and 1 unit of nutrients A, B, and C respectively. Two different kinds of fodder are available. Each unit weight of these two contains the following amounts of these three nutrients:
| Nutrient\Fodder | Fodder 1 | Fodder2 |
| Nutrient A | 2 | 1 |
| Nutrient B | 2 | 3 |
| Nutrient C | 1 | 1 |
The cost of fodder 1 is ₹ 3 per unit and that of fodder ₹ 2 per unit. Formulate the L.P.P. to minimize the cost.
Choose the correct alternative :
The corner points of the feasible region given by the inequations x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0, are
A train carries at least twice as many first class passengers (y) as second class passengers (x). The constraint is given by ______.
The point of which the maximum value of z = x + y subject to constraints x + 2y ≤ 70, 2x + y ≤ 90, x ≥ 0, y ≥ 0 is obtained at
Maximize z = 7x + 11y subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0
Solve the following linear programming problem graphically.
Maximize Z = 3x1 + 5x2 subject to the constraints: x1 + x2 ≤ 6, x1 ≤ 4; x2 ≤ 5, 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 ______.
Find graphical solution for the following system of linear in equation:
x + 2y ≥ 4, 2x - y ≤ 6
