Advertisements
Advertisements
प्रश्न
Choose the correct alternative :
Which of the following is correct?
विकल्प
Every LPP has on optional solution
Every LPP has unique optional solution.
If LPP has two optional solution then it has infinitely many solutions.
The set of all feasible solutions of LPP may not be a convex set.
उत्तर
If LPP has two optional solution then it has infinitely many solutions.
APPEARS IN
संबंधित प्रश्न
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 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.
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 :
The optimal value of the objective function is attained at the _______ points of feasible region.
A train carries at least twice as many first class passengers (y) as second class passengers (x) The constraint is given by_______
Choose the correct alternative:
The feasible region is
Choose the correct alternative:
Z = 9x + 13y subjected to constraints 2x + 3y ≤ 18, 2x + y ≤ 10, 0 ≤ x, y was found to be maximum at the point
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.
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?
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.
Maximize Z = 3x1 + 5x2 subject to the constraints: x1 + x2 ≤ 6, x1 ≤ 4; x2 ≤ 5, and x1, x2 ≥ 0.
Which of the following can be considered as the objective function of a linear programming problem?
Solve the following LP.P.
Maximize z = 13x + 9y,
Subject to 3x + 2y ≤ 12,
x + y ≥ 4,
x ≥ 0,
y ≥ 0.
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.
Find graphical solution for the following system of linear in equation:
x + 2y ≥ 4, 2x - y ≤ 6
