Advertisements
Advertisements
प्रश्न
Maximize z = 5x + 2y subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0
Advertisements
उत्तर
To draw the feasible region, construct table as follows:
| Inequality | 3x + 5y ≤ 15 | 5x + 2y ≤ 10 |
| Corresponding equation (of line) | 3x + 5y = 15 | 5x + 2y = 10 |
| Intersection of line with X-axis | (5, 0) | (2, 0) |
| Intersection of line with Y-axis | (0, 3) | (0, 5) |
| Region | Origin side | Origin side |
x ≥ 0, y ≥ 0 represent 1st quadrant.
Here, the objective function is Z = 5x + 2y
∴ Z at O(0, 0) = 5(0) + 2(0) = 0
Z at Q(2, 0) = 5(2) + 2(0) = 10
Z at R `(20/19, 45/19) = 5 (20/19) + 2(45/19) = 10`
Z at A(0, 3) = 5(0) + 2(3) = 6
The maximum value of Z is 10 and it occurs at every point lying on the line segment joining `"R"(20/19, 45/19)` and Q(2, 0).
Hence, there are infinitely many optimal solutions.
संबंधित प्रश्न
Find the feasible solution of the following inequation:
3x + 4y ≥ 12, 4x + 7y ≤ 28, y ≥ 1, x ≥ 0.
A furniture dealer deals in tables and chairs. He has ₹ 1,50,000 to invest and a space to store at most 60 pieces. A table costs him ₹ 1500 and a chair ₹ 750. Construct the inequations and find the feasible solution.
A manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry and then sent to the machine shop for finishing. The number of man-hours of labour required in each shop for production of A and B per unit and the number of man-hours available for the firm is as follows:
| Gadgets | Foundry | Machine shop |
| A | 10 | 5 |
| B | 6 | 4 |
| Time available (hour) | 60 | 35 |
Profit on the sale of A is ₹ 30 and B is ₹ 20 per units. Formulate the L.P.P. to have maximum profit.
A manufacturer produces bulbs and tubes. Each of these must be processed through two machines M1 and M2. A package of bulbs requires 1 hour of work on Machine M1 and 3 hours of work on Machine M2. A package of tubes requires 2 hours on Machine M1 and 4 hours on Machine M2. He earns a profit of ₹ 13.5 per package of bulbs and ₹ 55 per package of tubes. Formulate the LPP to maximize the profit, if he operates the machine M1, for almost 10 hours a day and machine M2 for almost 12 hours a day.
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:
| Fertilizers→ | F1 | F2 | Availability |
| Raw Material ↓ | |||
| A | 2 | 3 | 40 |
| B | 1 | 4 | 70 |
By selling one unit of F1 and one unit of F2, the company gets a profit of ₹ 500 and ₹ 750 respectively. Formulate the problem as LPP to maximize the profit.
If John drives a car at a speed of 60 km/hour, he has to spend ₹ 5 per km on petrol. If he drives at a faster speed of 90 km/hour, the cost of petrol increases ₹ 8 per km. He has ₹ 600 to spend on petrol and wishes to travel the maximum distance within an hour. Formulate the above problem as L.P.P.
Solution of LPP to minimize z = 2x + 3y, such that x ≥ 0, y ≥ 0, 1 ≤ x + 2y ≤ 10 is ______.
Solve the following LPP:
Maximize z = 5x1 + 6x2 subject to 2x1 + 3x2 ≤ 18, 2x1 + x2 ≤ 12, x1 ≥ 0, x2 ≥ 0.
Solve each of the following inequations graphically using XY-plane:
- 11x - 55 ≤ 0
Find graphical solution for the following system of linear in equation:
3x + 4y ≤ 12, x - 2y ≥ 2, y ≥ - 1
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 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 printing company prints two types of magazines A and B. The company earns ₹ 10 and ₹ 15 on magazines A and B per copy. These are processed on three machines I, II, III. Magazine A requires 2 hours on Machine I, 5 hours on Machine II and 2 hours on Machine III. Magazine B requires 3 hours on Machine I, 2 hours on Machine II and 6 hours on Machine III. Machines I, II, III are available for 36, 50, 60 hours per week respectively. Formulate the Linear programming problem to maximize the profit.
Choose the correct alternative :
Which of the following is correct?
Choose the correct alternative :
Solution of LPP to minimize z = 2x + 3y st. x ≥ 0, y ≥ 0, 1≤ x + 2y ≤ 10 is
If the corner points of the feasible region are (0, 0), (3, 0), (2, 1) and `(0, 7/3)` the maximum value of z = 4x + 5y is ______.
Fill in the blank :
“A gorage employs eight men to work in its shownroom and repair shop. The constraints that there must be at least 3 men in showroom and at least 2 men in repair shop are ______ and _______ respectively.
Fill in the blank :
A dish washing machine holds up to 40 pieces of large crockery (x) This constraint is given by_______.
Maximize z = 10x + 25y subject to x + y ≤ 5, 0 ≤ x ≤ 3, 0 ≤ y ≤ 3
Minimize z = 2x + 4y is subjected to 2x + y ≥ 3, x + 2y ≥ 6, x ≥ 0, y ≥ 0 show that the minimum value of z occurs at more than two points
State whether the following statement is True or False:
Objective function of LPP is a relation between the decision variables
State whether the following statement is True or False:
LPP is related to efficient use of limited resources
Constraints are always in the form of ______ or ______.
The constraint that in a particular XII class, number of boys (y) are less than number of girls (x) is given by ______
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.
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.
A company manufactures two models of voltage stabilizers viz., ordinary and auto-cut. All components of the stabilizers are purchased from outside sources, assembly and testing is carried out at the company’s own works. The assembly and testing time required for the two models are 0.8 hours each for ordinary and 1.20 hours each for auto-cut. Manufacturing capacity 720 hours at present is available per week. The market for the two models has been surveyed which suggests a maximum weekly sale of 600 units of ordinary and 400 units of auto-cut. Profit per unit for ordinary and auto-cut models has been estimated at ₹ 100 and ₹ 150 respectively. Formulate the linear programming problem.
Solve the following linear programming problems by graphical method.
Maximize Z = 6x1 + 8x2 subject to constraints 30x1 + 20x2 ≤ 300; 5x1 + 10x2 ≤ 110; and x1, x2 ≥ 0.
Solve the following linear programming problems by graphical method.
Minimize Z = 3x1 + 2x2 subject to the constraints 5x1 + x2 ≥ 10; x1 + x2 ≥ 6; x1 + 4x2 ≥ 12 and x1, x2 ≥ 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.
Maximize: z = 3x1 + 4x2 subject to 2x1 + x2 ≤ 40, 2x1 + 5x2 ≤ 180, x1, x2 ≥ 0. In the LPP, which one of the following is feasible comer point?
A solution which maximizes or minimizes the given LPP is called
The minimum value of the objective function Z = x + 3y subject to the constraints 2x + y ≤ 20, x + 2y ≤ 20, x > 0 and y > 0 is
A firm manufactures pills in two sizes A and B. Size A contains 2 mgs of aspirin, 5 mgs of bicarbonate and 1 mg of codeine. Size B contains 1 mg. of aspirin, 8 mgs. of bicarbonate and 6 mgs. of codeine. It is found by users that it requires at least 12 mgs. of aspirin, 74 mgs. of bicarbonate and 24 mgs. of codeine for providing immediate relief. It is required to determine the least number of pills a patient should take to get immediate relief. Formulate the problem as a standard LLP.
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 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 linear programming problem graphically.
Maximize Z = 60x1 + 15x2 subject to the constraints: x1 + x2 ≤ 50; 3x1 + x2 ≤ 90 and x1, x2 ≥ 0.
The values of θ satisfying sin7θ = sin4θ - sinθ and 0 < θ < `pi/2` are ______
For the following shaded region, the linear constraint are:
Solve the following problems by graphical method:
Maximize z = 4x + 2y subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0 y ≥ 0
Find graphical solution for the following system of linear in equation:
x + 2y ≥ 4, 2x - y ≤ 6
