Advertisements
Advertisements
प्रश्न
Minimize z = 6x + 21y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0 show that the minimum value of z occurs at more than two points
Advertisements
उत्तर
To draw the feasible region, construct table as follows:
| Inequality | x + 2y ≥ 3 | x + 4y ≥ 4 | 3x + y ≥ 3 |
| Corresponding equation (of line) | x + 2y = 3 | x + 4y = 4 | 3x + y = 3 |
| Intersection of line with X-axis | (3, 0) | (4, 0) | (1, 0) |
| Intersection of line with Y-axis | `(0, 3/2)` | (0, 1) | (0, 3) |
| Region | Non-origin side | Non-origin side | Non-origin side |
x ≥ 0, y ≥ 0 represent 1st quadrant.
Shaded portion XABCDY is the feasible region, whose vertices are A(4, 0), B, C and D(0, 3).
B is the point of intersection of the lines x + 4y = 4 and x + 2y = 3.
Solving the above equations, we get
x = 2, y = `1/2`
∴ B ≡ `(2, 1/2)`
C is the point of intersection of the lines x + 2y = 3 and 3x + y = 3.
Solving the above equations, we get
x = `3/5`, y = `6/5`
∴ C ≡ `(3/5, 6/5)`
Here, the objective function is Z = 6x + 21y
∴ Z at A(4, 0) = 6(4) + 21(0) = 24
Z at B`(2, 1/2) = 6(2) + 21(1/2)`
= `12 + 21/2`
= `45/2`
= 22.5
Z at C`(3/5, 6/5) = 6(3/5) + 21(6/5)`
= `18/5 + 126/5`
= `144/5`
= 28.8
Z at D(0, 3) = 6(0) + 21(3) = 63
∴ Z has minimum value 22.5 at B`(2, 1/2)`.
∴ Z has minimum value 22.5 when x = 2 and y = 0.5.
APPEARS IN
संबंधित प्रश्न
Find the feasible solution of the following inequation:
2x + 3y ≤ 6, x + y ≥ 2, x ≥ 0, y ≥ 0
Find the feasible solution of the following inequation:
3x + 4y ≥ 12, 4x + 7y ≤ 28, y ≥ 1, x ≥ 0.
Find the feasible solution of the following inequations:
x - 2y ≤ 2, x + y ≥ 3, - 2x + y ≤ 4, x ≥ 0, y ≥ 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 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.
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.
The company makes concrete bricks made up of cement and sand. The weight of a concrete brick has to be at least 5 kg. Cement costs ₹ 20 per kg and sand costs of ₹ 6 per kg. Strength consideration dictates that a concrete brick should contain minimum 4 kg of cement and not more than 2 kg of sand. Form the L.P.P. for the cost to be minimum.
Solve the following LPP by graphical method:
Maximize z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
Solve the following L.P.P. by graphical method:
Minimize: z = 8x + 10y
Subject to: 2x + y ≥ 7, 2x + 3y ≥ 15, y ≥ 2, x ≥ 0, y ≥ 0.
Minimize z = 6x + 21y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0.
Which of the following is correct?
The maximum value of z = 5x + 3y subject to the constraints 3x + 5y ≤ 15, 5x + 2y ≤ 10, x, y ≥ 0 is ______.
Of all the points of the feasible region, the optimal value of z obtained at the point lies ______.
The half-plane represented by 3x + 2y < 8 contains the point ______.
Solve the following LPP:
Maximize z = 6x + 10y subject to 3x + 5y ≤ 10, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0.
Solve each of the following inequations graphically using XY-plane:
5y - 12 ≥ 0
Find graphical solution for the following system of linear in equation:
3x + 4y ≤ 12, x - 2y ≥ 2, y ≥ - 1
A carpenter makes chairs and tables. Profits are ₹ 140 per chair and ₹ 210 per table. Both products are processed on three machines: Assembling, Finishing and Polishing. The time required for each product in hours and availability of each machine is given by the following table:
| Product → | Chair (x) | Table (y) | Available time (hours) |
| Machine ↓ | |||
| Assembling | 3 | 3 | 36 |
| Finishing | 5 | 2 | 50 |
| Polishing | 2 | 6 | 60 |
Formulate the above problem as LPP. Solve it graphically
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.
A company manufactures two types of chemicals A and B. Each chemical requires two types of raw material P and Q. The table below shows number of units of P and Q required to manufacture one unit of A and one unit of B.
| Raw Material \Chemical | A | B | Availability |
| p | 3 | 2 | 120 |
| Q | 2 | 5 | 160 |
The company gets profits of ₹ 350 and ₹ 400 by selling one unit of A and one unit of B respectively. Formulate the problem as L.P.P. to maximize the profit.
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 :
Of all the points of the feasible region the optimal value of z is obtained at a point
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
Choose the correct alternative :
The half plane represented by 3x + 2y ≤ 0 constraints the point.
Choose the correct alternative :
The half plane represented by 4x + 3y ≥ 14 contains the point
The optimal value of the objective function is attained at the ______ points of the feasible region.
Fill in the blank :
A dish washing machine holds up to 40 pieces of large crockery (x) This constraint is given by_______.
State whether the following is True or False :
The feasible solution of LPP belongs to only quadrant I.
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
State whether the following statement is True or False:
Objective function of LPP is a relation between the decision variables
The constraint that in a particular XII class, number of boys (y) are less than number of girls (x) is given by ______
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.
A solution which maximizes or minimizes the given LPP is called
In the given graph the coordinates of M1 are
Given an L.P.P maximize Z = 2x1 + 3x2 subject to the constrains x1 + x2 ≤ 1, 5x1 + 5x2 ≥ 0 and x1 ≥ 0, x2 ≥ 0 using graphical method, we observe
A firm manufactures two products A and B on which the profits earned per unit are ₹ 3 and ₹ 4 respectively. Each product is processed on two machines M1 and M2. Product A requires one minute of processing time on M1 and two minutes on M2, While B requires one minute on M1 and one minute on M2. Machine M1 is available for not more than 7 hrs 30 minutes while M2 is available for 10 hrs during any working day. Formulate this problem as a linear programming problem to maximize the profit.
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.
The LPP to maximize Z = x + y, subject to x + y ≤ 1, 2x + 2y ≥ 6, x ≥ 0, y ≥ 0 has ________.
The values of θ satisfying sin7θ = sin4θ - sinθ and 0 < θ < `pi/2` are ______
Which of the following can be considered as the objective function of a linear programming problem?
The optimal value of the objective function is attained at the ______ of feasible region.
Solution which satisfy all constraints is called ______ solution.
Solve the following problems by graphical method:
Maximize z = 4x + 2y subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0 y ≥ 0
Solve the following LPP:
Maximize z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
Sketch the graph of the following inequation in XOY co-ordinate system.
2y - 5x ≥ 0
