Advertisements
Advertisements
प्रश्न
Select the appropriate alternatives for each of the following question:
The value of objective function is maximum under linear constraints
विकल्प
at the centre of feasible region
at (0, 0)
at a vertex of feasible region
the vertex which is of maximum distance from (0, 0).
Advertisements
उत्तर
at a vertex of feasible region
Notes
The answer in the textbook is incorrect.
APPEARS IN
संबंधित प्रश्न
Find the feasible solution of the following inequation:
3x + 2y ≤ 18, 2x + y ≤ 10, 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 inequation:
x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.
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.
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 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.
Solve the following LPP by graphical method:
Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, 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.
The corner points of the feasible solution given by the inequation x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0 are ______.
The corner points of the feasible solution are (0, 0), (2, 0), `(12/7, 3/7)`, (0, 1). Then z = 7x + y is maximum at ______.
The half-plane represented by 4x + 3y >14 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:
- 11x - 55 ≤ 0
Find graphical solution for the following system of linear in equation:
3x + 4y ≤ 12, x - 2y ≥ 2, y ≥ - 1
Solve the following LPP:
Minimize z = 4x + 2y
Subject to 3x + y ≥ 27, x + y ≥ 21, x + 2y ≥ 30, x ≥ 0, y ≥ 0
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 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 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.
In a cattle breeding firm, it is prescribed that the food ration for one animal must contain 14, 22, and 1 unit of nutrients A, B, and C respectively. Two different kinds of fodder are available. Each unit weight of these two contains the following amounts of these three nutrients:
| Nutrient\Fodder | Fodder 1 | Fodder2 |
| Nutrient A | 2 | 1 |
| Nutrient B | 2 | 3 |
| Nutrient C | 1 | 1 |
The cost of fodder 1 is ₹ 3 per unit and that of fodder ₹ 2 per unit. Formulate the L.P.P. 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.
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.
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 are (0, 0), (2, 0), `(12/7, 3/7)` and (0,1) then the point of maximum z = 7x + y
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 ______.
Choose the correct alternative :
The half plane represented by 3x + 2y ≤ 0 constraints the point.
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 feasible region is the set of point which satisfy.
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 = 7x + y subjected to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.
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:
LPP is related to efficient use of limited resources
The constraint that in a particular XII class, number of boys (y) are less than number of girls (x) is given by ______
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 = 40x1 + 50x2 subject to constraints 3x1 + x2 ≤ 9; x1 + 2x2 ≤ 8 and x1, x2 ≥ 0.
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 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.
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.
For the following shaded region, the linear constraint are:
