Advertisements
Advertisements
प्रश्न
A company produces two types of pens A and B. Pen A is of superior quality and pen B is of lower quality. Profits on pens A and B are ₹ 5 and ₹ 3 per pen respectively. Raw materials required for each pen A is twice as that of pen B. The supply of raw material is sufficient only for 1000 pens per day. Pen A requires a special clip and only 400 such clips are available per day. For pen B, only 700 clips are available per day. Formulate this problem as a linear programming problem.
Advertisements
उत्तर
(i) Variables: Let x1 and x2 denote the number of pens in type A and type B.
(ii) Objective function:
Profit on x1 pens in type A = 5x1
Profit on x2 pens in type B is 3x2
Total profit = 5x1 + 3x2
Let Z = 5x1 + 3x2, which is the objective function.
Since the B total profit is to be maximized, we have to maximize Z = 5x1 + 3x2
(iii) Constraints:
Raw materials required for each pen A is twice as that of pen B.
i.e., for pen A raw material required is 2x1 and for B is x2.
Raw material is sufficient only for 1000 pens per day
∴ 2x1 + x2 ≤ 1000
Pen A requires 400 clips per day
∴ x1 ≤ 400
Pen B requires 700 clips per day
∴ x2 ≤ 700
(iv) Non-negative restriction:
Since the number of pens is non-negative, we have x1 > 0, x2 > 0.
Thus, the mathematical formulation of the LPP is Maximize Z = 5x1 + 3x2
Subject to the constrains
2x1 + x2 ≤ 1000, x1 ≤ 400, x2 ≤ 700, x1, x2 ≥ 0
APPEARS IN
संबंधित प्रश्न
Which of the following statements is correct?
In a cattle breading firm, it is prescribed that the food ration for one animal must contain 14. 22 and 1 units of nutrients A, B, and C respectively. Two different kinds of fodder are available. Each unit of these two contains the following amounts of these three nutrients:
| Fodder → | Fodder 1 | Fodder 2 |
| Nutrient ↓ | ||
| Nutrients A | 2 | 1 |
| Nutrients B | 2 | 3 |
| Nutrients C | 1 | 1 |
The cost of fodder 1 is ₹ 3 per unit and that of fodder 2 ₹ 2. Formulate the LPP to minimize the cost.
Solve the following LPP by graphical method:
Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0
Solve the following LPP by graphical method:
Maximize z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
Solve each of the following inequations graphically using XY-plane:
5y - 12 ≥ 0
A company produces mixers and food processors. Profit on selling one mixer and one food processor is Rs 2,000 and Rs 3,000 respectively. Both the products are processed through three machines A, B, C. The time required in hours for each product and total time available in hours per week on each machine arc as follows:
| Machine | Mixer | Food Processor | Available time |
| A | 3 | 3 | 36 |
| B | 5 | 2 | 50 |
| C | 2 | 6 | 60 |
How many mixers and food processors should be produced in order to maximize the profit?
Minimize z = 7x + y subjected to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.
Solve the following linear programming problems by graphical method.
Minimize Z = 20x1 + 40x2 subject to the constraints 36x1 + 6x2 ≥ 108; 3x1 + 12x2 ≥ 36; 20x1 + 10x2 ≥ 100 and x1, x2 ≥ 0.
Solve the following linear programming problem graphically.
Maximise Z = 4x1 + x2 subject to the constraints x1 + x2 ≤ 50; 3x1 + x2 ≤ 90 and x1 ≥ 0, x2 ≥ 0.
Solve the following LP.P.
Maximize z = 13x + 9y,
Subject to 3x + 2y ≤ 12,
x + y ≥ 4,
x ≥ 0,
y ≥ 0.
