Advertisements
Advertisements
प्रश्न
Find the feasible solution of the following inequation:
3x + 4y ≥ 12, 4x + 7y ≤ 28, y ≥ 1, x ≥ 0.
उत्तर
First we draw the lines AB, CD and EF whose equations are 3x + 4y = 12 and 4x + 7y = 28 and y= 1 respectively.
| Line | Equation | Points on the X-axis | Points on the Y-axis | Sign | Region |
| AB | 3x + 4y = 12 | A (4,0) | B (0,3) | ≥ | non-origin side of line AB |
| CB | 4x + 7y = 28 | C (7,0) | D(0,4) | ≤ | origin side of line CD |
| EF | y = 1 | - | F(0,1) | ≥ | non-origin side of line EF |
The feasible solution is PQDB which is shaded in the graph.
APPEARS IN
संबंधित प्रश्न
Find the feasible solution of the following inequation:
x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.
Find the feasible solution of the following inequations:
x - 2y ≤ 2, x + y ≥ 3, - 2x + y ≤ 4, x ≥ 0, y ≥ 0
A printing company prints two types of magazines A and B. The company earns ₹ 10 and ₹ 15 in 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, and 60 hours per week respectively. Formulate the LPP to determine weekly production of magazines A and B, so that the total profit is maximum.
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.
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 ______.
If the corner points of the feasible solution are (0, 10), (2, 2) and (4, 0), then the point of minimum z = 3x + 2y is ______.
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:
4x - 18 ≥ 0
Solve each of the following inequations graphically using XY-plane:
- 11x - 55 ≤ 0
Sketch the graph of the following inequation in XOY co-ordinate system:
|x + 5| ≤ y
Solve the following LPP:
Minimize z = 4x + 2y
Subject to 3x + y ≥ 27, x + y ≥ 21, x + 2y ≥ 30, x ≥ 0, y ≥ 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?
A firm manufacturing two types of electrical items A and B, can make a profit of ₹ 20 per unit of A and ₹ 30 per unit of B. Both A and B make use of two essential components a motor and a transformer. Each unit of A requires 3 motors and 2 transformers and each units of B requires 2 motors and 4 transformers. The total supply of components per month is restricted to 210 motors and 300 transformers. How many units of A and B should be manufactured per month to maximize profit? How much is the 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 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 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. If maximum availability of Machine M1 is 10 hours and that of Machine M2 is 12 hours, then formulate the L.P.P. 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.
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
Choose the correct alternative :
The half plane represented by 4x + 3y ≥ 14 contains the point
State whether the following is True or False :
The point (1, 2) is not a vertex of the feasible region bounded by 2x + 3y ≤ 6, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0.
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 = 10x + 25y subject to x + y ≤ 5, 0 ≤ x ≤ 3, 0 ≤ y ≤ 3
Solve the Linear Programming problem graphically:
Maximize z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0 also find the maximum value of z.
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
x − y ≤ 1, x − y ≥ 0, x ≥ 0, y ≥ 0 are the constant for the objective function z = x + y. It is solvable for finding optimum value of z? Justify?
The variables involved in LPP are called ______
Constraints are always in the form of ______ or ______.
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.
In the given graph the coordinates of M1 are
The values of θ satisfying sin7θ = sin4θ - sinθ and 0 < θ < `pi/2` are ______
The point which provides the solution of the linear programming problem, Max.(45x + 55y) subject to constraints x, y ≥ 0, 6x + 4y ≤ 120, 3x + 10y ≤ 180, is ______
The set of feasible solutions of LPP is a ______.
Solution which satisfy all constraints is called ______ solution.
Two kinds of foods A and B are being considered to form a weekly diet. The minimum weekly requirements of fats, Carbohydrates and proteins are 12, 16 and 15 units respectively. One kg of food A has 2, 8 and 5 units respectively of these ingredients and one kg of food B has 6, 2 and 3 units respectively. The price of food A is Rs. 4 per kg and that of food B is Rs. 3 per kg. Formulate the L.P.P. and find the minimum cost.
Sketch the graph of the following inequation in XOY co-ordinate system.
x + y ≤ 0
Find graphical solution for the following system of linear in equation:
x + 2y ≥ 4, 2x - y ≤ 6
