Maximize Z = - x + 2y, subject to the constraints are x ≥ 3, x + y ≥ 5, x + 2y ≥ 6 and x, y ≥ 0.
Our problem is to maximize Z = -x + 2y .........(i)
Subject to constraints are x ≥ 3 ..........(ii)
x + y ≥ 5 ..........(iii)
x + 2y ≥ 6 ......(iv)
x ≥ 0, y ≥ 0 .........(v)
Firstly, draw the graph of the line x + y = 5
x05y50
Putting (0, 0) in the inequality x + y ≥ 5, we have
0 + 0 ≥ 5
⇒ 0 ≥ 5 (which is false)
So, the half plane is away from the origin.
Secondly, draw the graph of line x + 2y = 6
x06y30
Putting (0, 0) in the inequality x + 2y ≥ 6, we have
0+2×0≥6
⇒0≥6 (which is false)
So, the half plane is away from the origin,
Thirdly, draw the graph of the line - x + 2y = 1
x0−1y120
Putting (0, 0) in the inequality
- x + 2y > 1, we have
−0+2×0>1
⇒0>1 (which is false)
So, the half plane is away from the origin.
Since, x≥3, y≥0
So, the feasible region lies in the first quadrant. The points of intersection of lines x = 3 and - x + 2y = 1 is C(3, 2) and lines x + 2y = 6 and x + y = 5 is E(4, 1).
It can be seen that the feasible region is unbounded.
The corner points of the feasible region are A(6, 0), B(4, 1) and C(3, 2). The values of Z at these points are as follows:
Corner pointZ=−x+2yA(6, 0)−6B(4, 1)−2C(3, 2)1←Maximum
As the feasible region is unbounded therefore, Z = 1 may or may not be the maximum value. For this, we graph the inequality, - x + 2y > 1 and check whether the resulting half plane has points in common with the feasible region or not.
The resulting feasible region has points in common with the feasible region. Therefore, Z = 1 is not the maximum value.
Hence, Z has no maximum value.