Advertisements
Advertisements
प्रश्न
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.
पर्याय
True
False
Advertisements
उत्तर
Since (1, 2) does not satisfy any of the equations 2x + 3y = 6 and 5x + 3y = 15, it is not a vertex of the feasible region True.
APPEARS IN
संबंधित प्रश्न
A company manufactures two types of chemicals Aand 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 and the total availability of P and Q.
| Chemical→ | A | B | Availability |
| Raw Material ↓ | |||
| 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. (Assume that the entire production of A and B can be sold). How many units of the chemicals A and B should be manufactured so that the company gets a maximum profit? Formulate the problem as LPP to maximize profit.
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 = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, 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.
Select the appropriate alternatives for each of the following question:
The value of objective function is maximum under linear constraints
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 ______.
The half-plane represented by 3x + 2y < 8 contains the point ______.
Solve the following LPP:
Maximize z =60x + 50y subject to
x + 2y ≤ 40, 3x + 2y ≤ 60, 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 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.
Solve the following L.P.P. by graphical method:
Maximize: Z = 4x + 6y
Subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
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
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 ______.
The optimal value of the objective function is attained at the ______ points of the feasible region.
State whether the following is True or False :
The feasible solution of LPP belongs to only quadrant I.
Maximize z = 7x + 11y subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0
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
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
The variables involved in LPP are called ______
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.
Maximize Z = 40x1 + 50x2 subject to constraints 3x1 + x2 ≤ 9; x1 + 2x2 ≤ 8 and x1, x2 ≥ 0.
The maximum value of the objective function Z = 3x + 5y subject to the constraints x ≥ 0, y ≥ 0 and 2x + 5y ≤ 10 is:
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.
Maximize Z = 3x1 + 5x2 subject to the constraints: x1 + x2 ≤ 6, x1 ≤ 4; x2 ≤ 5, and x1, x2 ≥ 0.
The set of feasible solutions of LPP is a ______.
Find graphical solution for the following system of linear in equation:
x + 2y ≥ 4, 2x - y ≤ 6
