Advertisements
Advertisements
प्रश्न
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.
उत्तर
Given that 36x1 + 6x2 ≥ 108
Let 36x1 + 6x2 = 108
6x1 + x2 = 18
| x1 | 0 | 3 | 2 |
| x2 | 18 | 0 | 6 |
Also given that 3x1 + 12x2 ≥ 36
Let 3x1 + 12x2 = 36
x1 + 4x2 = 12
| x1 | 0 | 12 | 4 |
| x2 | 3 | 0 | 2 |
Also given that 20x1 + 10x2 ≥ 100
Let 20x1 + 10x2 = 100
2x1 + x2 = 10
| x1 | 0 | 5 | 4 |
| x2 | 10 | 0 | 2 |
The feasible region satisfying all the conditions is ABCD.
The coordinates of the comer points are A(12, 0), B(4, 2), C(2, 6) and D(0, 18).
| Corner points | Z = 20x1 + 40x2 |
| A(12, 0) | 240 |
| B(4, 2) | 80 + 80 = 160 |
| C(2, 6) | 40 + 240 = 280 |
| D(0, 18) | 720 |
The minimum value of Z occurs at B(4, 2)
∴ The optimal solution is x1 = 4, x2 = 2 and Zmin = 160
APPEARS IN
संबंधित प्रश्न
Solve the following LPP by graphical method:
Maximize z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
The maximum value of z = 5x + 3y subject to the constraints 3x + 5y ≤ 15, 5x + 2y ≤ 10, x, y ≥ 0 is ______.
Solution of LPP to minimize z = 2x + 3y, such that x ≥ 0, y ≥ 0, 1 ≤ x + 2y ≤ 10 is ______.
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?
A company manufactures two types of fertilizers F1 and F2. Each type of fertilizer requires two raw materials A and B. The number of units of A and B required to manufacture one unit of fertilizer F1 and F2 and availability of the raw materials A and B per day are given in the table below:
| Raw Material\Fertilizers | F1 | F2 | Availability |
| A | 2 | 3 | 40 |
| B | 1 | 4 | 70 |
By selling one unit of F1 and one unit of F2, company gets a profit of ₹ 500 and ₹ 750 respectively. Formulate the problem as L.P.P. to maximize the profit.
Which value of x is in the solution set of inequality − 2X + Y ≥ 17
Choose the correct alternative:
The feasible region is
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.
Solve the following linear programming problem graphically.
Minimize Z = 200x1 + 500x2 subject to the constraints: x1 + 2x2 ≥ 10; 3x1 + 4x2 ≤ 24 and x1 ≥ 0, x2 ≥ 0.
Solve the following LPP:
Maximize z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
