Advertisements
Advertisements
Question
Solve the following Linear Programming Problems graphically:
Minimise Z = 3x + 5y
such that x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0.
Advertisements
Solution
The system of constraints is:
x + 3y ≥ 3 ....(i)
x + y ≥ 2 ....(ii)
and x, y ≥ 0 ....(iii)
Let l1 : x + 3y = 3
l2 : x + y = 2
The shaded region in the figure is the feasible region determined by the system of constraints (i) to (iii).
The feasible region is unbounded.
We use the corner point method to determine the minimum value of Z,
We have,
Z = 3x + 5y
The co-ordinated of A, E and D are (3, 0), `(3/2, 1/2).`
(on solving x + 3y = 3 and x + y = 2) and (0, 2) respectively.
We evaluate Z at each corner point
| Corner point | Corresponding value of Z |
| (3, 0) | 9 |
| `(3/2, 1/2)` | 7 (Minimum) |
| (0, 2) | 10 |
Now, Since the region is unbounded we need to check whether 7 is the minimum value or not. To decide this, we graph the inequality 3x + 5y < 7.
Now, in the graph, we observe that 7 does not have points in common with a feasible region.
So, 7 is the minimum value at Z.
Hence, Zmin = 7 at `(3/2, 1/2)`
APPEARS IN
RELATED QUESTIONS
Solve the following Linear Programming Problems graphically:
Maximise Z = 3x + 2y
subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0.
Refer to Example 9. How many packets of each food should be used to maximize the amount of vitamin A in the diet? What is the maximum amount of vitamin A in the diet?
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?
An aeroplane can carry a maximum of 200 passengers. A profit of Rs 1000 is made on each executive class ticket and a profit of Rs 600 is made on each economy class ticket. The airline reserves at least 20 seats for executive class. However, at least 4 times as many passengers prefer to travel by economy class than by the executive class. Determine how many tickets of each type must be sold in order to maximize the profit for the airline. What is the maximum profit?
If the feasible region for a linear programming problem is bounded, then the objective function Z = ax + by has both a maximum and a minimum value on R.
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
Feasible region (shaded) for a LPP is shown in Figure. Maximise Z = 5x + 7y.
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.
Refer to question 15. Determine the maximum distance that the man can travel.
Maximise Z = x + y subject to x + 4y ≤ 8, 2x + 3y ≤ 12, 3x + y ≤ 9, x ≥ 0, y ≥ 0.
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 |
Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. The Minimum value of F occurs at ______.
In a LPP, the linear inequalities or restrictions on the variables are called ____________.
If the feasible region for a LPP is ______ then the optimal value of the objective function Z = ax + by may or may not exist.
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.
A feasible region of a system of linear inequalities is said to be ______ if it can be enclosed within a circle.
A corner point of a feasible region is a point in the region which is the ______ of two boundary lines.
In the given graph, the feasible region for an LPP is shaded. The objective function Z = 2x – 3y will be minimum at:
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 ____________.
In linear programming infeasible solutions
In linear programming, optimal solution ____________.
In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case feasible region is unbounded, M is the maximum value of the objective function if ____________.
In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case the feasible region is unbounded, m is the minimum value of the objective function.
In a LPP, the objective function is always ____________.
Maximize Z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
Maximize Z = 10 x1 + 25 x2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.
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 ____________.
Maximize Z = 10×1 + 25×2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.
The feasible region for an LPP is shown shaded in the following figure. Minimum of Z = 4x + 3y occurs at the point.
