Advertisements
Advertisements
प्रश्न
Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 2, x ≥ 0, y ≥ 0.
Advertisements
उत्तर
The shaded region is the feasible region determined by the constraints x ≤ 3, y ≤ 2, x ≥ 0, y ≥.
The feasible region is bounded with four corners O(0, 0), A(3, 0), B(3, 2) and C(0, 2).
So, the maximum value can occur at any corner
Let us evaluate the value of Z.
| Corner points | Value of Z | |
| O(0, 0) | 11(0) + 7(0) = 0 | |
| A(3, 0) | 11(3) + 7(0) = 33 | |
| B(3, 2) | 11(3) + 7(2) = 47 | ← Maximum |
| C(0, 2) | 11(0) + 7(2) = 14 |
Hence, the maximum value of the function Z is 47 at (3, 2).
APPEARS IN
संबंधित प्रश्न
Solve the following Linear Programming Problems graphically:
Maximise Z = 3x + 4y
subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.
A farmer mixes two brands P and Q of cattle feed. Brand P, costing Rs 250 per bag contains 3 units of nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing Rs 200 per bag contains 1.5 units of nutritional elements A, 11.25 units of element B, and 3 units of element C. The minimum requirements of nutrients A, B and C are 18 units, 45 units and 24 units respectively. Determine the number of bags of each brand which should be mixed in order to produce a mixture having a minimum cost per bag? What is the minimum cost of the mixture per bag?
A dietician wishes to mix together two kinds of food X and Y in such a way that the mixture contains at least 10 units of vitamin A, 12 units of vitamin B and 8 units of vitamin C. The vitamin content of one kg food is given below:
| Food | Vitamin A | Vitamin B | Vitamin C |
| X | 1 | 2 | 3 |
| Y | 2 | 2 | 1 |
One kg of food X costs Rs 16 and one kg of food Y costs Rs 20. Find the least cost of the mixture which will produce the required diet?
A manufacturer makes two types of toys A and B. Three machines are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:
| Type of toy | Machines | ||
| I | II | III | |
| A | 12 | 18 | 6 |
| B | 6 | 0 | 9 |
Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A is Rs 7.50 and that on each toy of type B is Rs 5, show that 15 toys of type A and 30 of type B should be manufactured in a day to get maximum profit.
The minimum value of the objective function Z = ax + by in a linear programming problem always occurs at only one corner point of the feasible region
Determine the maximum value of Z = 11x + 7y subject to the constraints : 2x + y ≤ 6, x ≤ 2, x ≥ 0, y ≥ 0.
Minimise Z = 13x – 15y subject to the constraints: x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥ 0, y ≥ 0
Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown in Figure
Feasible region (shaded) for a LPP is shown in Figure. Maximise Z = 5x + 7y.
In figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y.
A man rides his motorcycle at the speed of 50 km/hour. He has to spend Rs 2 per km on petrol. If he rides it at a faster speed of 80 km/hour, the petrol cost increases to Rs 3 per km. He has atmost Rs 120 to spend on petrol and one hour’s time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem
Refer to question 13. Solve the linear programming problem and determine the maximum profit to the manufacturer
Refer to question 15. Determine the maximum distance that the man can travel.
A manufacturer produces two Models of bikes-Model X and Model Y. Model X takes a 6 man-hours to make per unit, while Model Y takes 10 man-hours per unit. There is a total of 450 man-hour available per week. Handling and Marketing costs are Rs 2000 and Rs 1000 per unit for Models X and Y respectively. The total funds available for these purposes are Rs 80,000 per week. Profits per unit for Models X and Y are Rs 1000 and Rs 500, respectively. How many bikes of each model should the manufacturer produce so as to yield a maximum profit? Find the maximum profit.
The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is Z = 4x + 3y ______.
Compare the quantity in Column A and Column B
| Column A | Column B |
| Maximum of Z | 325 |
Refer to Question 27. Maximum of Z occurs at ______.
The feasible region for an LPP is shown in the figure. Let F = 3x – 4y be the objective function. Maximum value of F is ______.
Refer to Question 32, Maximum of F – Minimum of F = ______.
In a LPP, the objective function is always ______.
In a LPP if the objective function Z = ax + by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same ______ value.
The feasible region for an LPP is always a ______ polygon.
If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax + by may or may not exist.
In a LPP, the minimum value of the objective function Z = ax + by is always 0 if the origin is one of the corner point of the feasible region.
In a LPP, the maximum value of the objective function Z = ax + by is always finite.
In a linear programming problem, the constraints on the decision variables x and y are x − 3y ≥ 0, y ≥ 0, 0 ≤ x ≤ 3. The feasible region:
The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x - 2y ≥ 0, x ≥ 0, y ≥ 0 is ____________.
A linear programming problem is one that is concerned with ____________.
A maximum or a minimum may not exist for a linear programming problem if ____________.
In a LPP, the objective function is always ____________.
Maximize Z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
Maximize Z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
Maximize Z = 6x + 4y, subject to x ≤ 2, x + y ≤ 3, -2x + y ≤ 1, x ≥ 0, y ≥ 0.
The feasible region for an LPP is shown shaded in the figure. Let Z = 3x - 4y be the objective function. Minimum of Z occurs at ____________.
The feasible region for an LPP is shown shaded in the following figure. Minimum of Z = 4x + 3y occurs at the point.
