Advertisements
Advertisements
प्रश्न
The optimal value of the objective function is attained at the ______ points of the feasible region.
Advertisements
उत्तर
The optimal value of the objective function is attained at the corner points of the feasible region.
Explanation:
- The optimal value of the objective function in a linear programming problem is always attained at the corner (or extreme) points of the feasible region.
- This is because linear functions achieve maximum or minimum values at these point
संबंधित प्रश्न
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 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.
A doctor has prescribed two different units of foods A and B to form a weekly diet for a sick person. The minimum requirements of fats, carbohydrates and proteins are 18, 28, 14 units respectively. One unit of food A has 4 units of fat, 14 units of carbohydrates and 8 units of protein. One unit of food B has 6 units of fat, 12 units of carbohydrates and 8 units of protein. The price of food A is ₹ 4.5 per unit and that of food B is ₹ 3.5 per unit. Form the LPP, so that the sick person’s diet meets the requirements at a minimum cost.
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.
If the corner points of the feasible solution are (0, 0), (3, 0), (2, 1), `(0, 7/3)` the maximum value of z = 4x + 5y is ______.
Solve each of the following inequations graphically using XY-plane:
- 11x - 55 ≤ 0
Solve the following LPP:
Maximize z =60x + 50y subject to
x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0.
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?
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.
Choose the correct alternative :
Which of the following is correct?
Objective function of LPP is ______.
Choose the correct alternative :
Feasible region; the set of points which satify.
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
Minimize z = 7x + y subjected to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.
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?
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 ______
In the given graph the coordinates of M1 are
The minimum value of the objective function Z = x + 3y subject to the constraints 2x + y ≤ 20, x + 2y ≤ 20, x > 0 and y > 0 is
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.
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.
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
Sketch the graph of the following inequation in XOY co-ordinate system.
2y - 5x ≥ 0
Find graphical solution for the following system of linear in equation:
x + 2y ≥ 4, 2x - y ≤ 6
