Advertisements
Advertisements
प्रश्न
Solve the following Linear Programming Problems graphically:
Maximise Z = 3x + 2y
subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0.
Advertisements
उत्तर
The system of constraints is
x + 2y ≤ 10 ....(i)
3x + y ≤ 15 ....(ii)
and x, y ≥ 0 ....(iii)
Let l1 : x + 2y = 10
l2 : 3x + y =15
The shaded region in the figure is the feasible region determined by the system of constraints (i) to (iii).
It is observed that the feasible region OCEB is bounded.
Thus, we use the Corner Point Method to determine the maximum value of Z.
We have: Z = 3x + 2y ....(iv)
The coordinates of O, C, E and B are (0, 0) (5, 0), (4, 3) (solving x + 2y = 10, 3x + y = 15) and (0, 5) respectively.
| Corner point | Corresponding values of Z |
| (0, 0) | 0 |
| (5, 0) | 15 |
| (4, 3) | 18 (Maximum) |
| (0, 5) | 10 |
Hence Zmax = 18 at (4, 3).
APPEARS IN
संबंधित प्रश्न
Solve the following Linear Programming Problems graphically:
Maximise Z = 3x + 4y
subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.
Solve the following Linear Programming Problems graphically:
Minimise Z = – 3x + 4 y
subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0.
Solve the following Linear Programming Problems graphically:
Minimise Z = x + 2y
subject to 2x + y ≥ 3, x + 2y ≥ 6, x, y ≥ 0.
Show that the minimum of Z occurs at more than two points.
Minimise and Maximise Z = x + 2y
subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, 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?
Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 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.
The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y
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.
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 30. Minimum value of F is ______.
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 ______.
Refer to Question 32, Maximum of F – Minimum of F = ______.
In a LPP, the maximum value of the objective function Z = ax + by is always finite.
Based on the given shaded region as the feasible region in the graph, at which point(s) is the objective function Z = 3x + 9y maximum?
A linear programming problem is as follows:
Minimize Z = 30x + 50y
Subject to the constraints: 3x + 5y ≥ 15, 2x + 3y ≤ 18, x ≥ 0, y ≥ 0
In the feasible region, the minimum value of Z occurs 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 ____________.
Z = 7x + y, subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.
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. If M and m respectively be the largest and smallest values at corner points then ____________.
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.
Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.
Maximize Z = 6x + 4y, subject to x ≤ 2, x + y ≤ 3, -2x + y ≤ 1, x ≥ 0, y ≥ 0.
Z = 6x + 21 y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value 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.
Which other constraint must be satisfied together with \[5x+y\leq 100\] in the profit-maximization formulation?
What are the unknown quantities in a Linear Programming Problem called?
