Limitation of Graphical Method

Graphical solution is limited to linear programming models containing only two decision variables.

Procedure

Step I: Convert each inequality as equation Step II: Plot each equation on the graph Step III: Shade the Feasible Region. Highlight the common Feasible region. Feasible Region: Set of all possible solutions. Step IV: Compute the coordinates of the corner points (of the feasible region). These corner points will represent the Feasible Solution. Feasible Solution: If it satisfies all the constraints and non negativity restrictions.

Procedure (Cont)

Step V: Substitute the coordinates of the corner points into the objective function to see which gives the Optimal Value. That will be the Optimal Solution. Optimal Solution: If it optimizes (maximizes or minimizes) the objective function. Unbounded Solution: If the value of the objective function can be increased or decreased indefinitely, Such solutions are called Unbounded solution. Inconsistent Solution: It means the solution of problem does not exist. This is possible when there is no common feasible region.

Example
x2
8 7 6 5 4 3 2 1

Max s.t.

z = 5x1 + 7x2 x1 < 2x1 + 3x2 < x1 + x2 < x1 , x2 > 0

6 19 8

Every point is in this nonnegative quadrant

10

x1

Example (Cont)
x2
8 7 6 5 4 3 2 1

Max s.t.

z = 5x1 + 7x2 x1 < 2x1 + 3x2 < x1 + x2 < x1 , x2 > 0

6 19 8

x1 < 6

(6, 0)
1 2 3 4 5 6 7 8 9 10

x1

Example (Cont)
x2
8 7 6 5 4 3 2 1

Max s.t.

(0, 6.33) 2x1 + 3x2 < 19

z = 5x1 + 7x2 x1 < 6 2x1 + 3x2 < 19 x1 + x2 < 8 x1 , x2 > 0

(9.5 , 0)
1 2 3 4 5 6 7 8 9 10

x1

Example (Cont)
x2
8 7 6 5 4 3 2 1

Max s.t.

(0, 8) x1 + x2 < 8

z = 5x1 + 7x2 x1 < 6 2x1 + 3x2 < 19 x1 + x2 < 8 x1 , x2 > 0

(8, 0)
1 2 3 4 5 6 7 8 9 10

x1

Example (Cont)
x2
8 7 6 5 4 3 2 1

Max s.t.

x1 + x2 < 8 x1 < 6

z = 5x1 + 7x2 x1 < 6 2x1 + 3x2 < 19 x1 + x2 < 8 x1 , x2 > 0

2x1 + 3x2 < 19 x1

10

Example (Cont)
x2
8 7 6 5 4 3
(5,3)D (0,6.33)E

2 1
A (0,0) (6,2)C

(6,0)B 5 6

10

x1

Example (Cont)
Objective Function : Max Z= 5x1+7x2 Corner Points A (0,0) B (6,0) C (6,2) D (5,3) E (0,6.33) Optimal Point : (5,3) Optimal Value : 46 Value of Z 0 30 44 46 44.33

Example
Max Z=3 P1 + 5 P2 s.t. P1 < 4 P2 < 6 3 P1 + 2 P2 < 18 P1, P2 >0

Example
P2

Max Z=3 P1 + 5 P2 s.t. P1 < 4 P2 < 6 3 P1 + 2 P2 < 18 P1, P2 >0

Every point is in this nonnegative quadrant

P1

Example (Cont)
P2

Max Z= 3 P1 + 5 P2 s.t. P1 < 4 P2 < 6 3 P1 + 2 P2 < 18 P1, P2 >0

(0,0)

(4,0)

P1

Example (Cont)
P2

(0,6)

Max Z= 3 P1 + 5 P2 s.t. P1 < 4 P2 < 6 3 P1 + 2 P2 < 18 P1, P2 >0

(0,0)

(4,0)

P1

Example (Cont)
P2

(0,6)

(2,6)

Max Z= 3 P1 + 5 P2 s.t. P1 < 4 P2 < 6 3 P1 + 2 P2 < 18 P1, P2 >0

(4,3)

(6,0)

(0,0)

(4,0)

P1

Example (Cont)
P2

(0,6)
E

(2,6)
D

(4,3)

(6,0)

(0,0)

(4,0)

P1

Example (Cont)
Objective Function : Max Z= 3 P1 + 5 P2 Corner Points A (0,0) B (4,0) C (4,3) D (2,6) E (0,6) Optimal Point : (2,6) Optimal Value : 36 Value of Z 0 12 27 36 30

Example
Min z = 5x1 + 2x2 s.t. 2x1 + 5x2 > 10 4x1 - x2 > 12 x1 + x2 > 4 x1, x2 > 0

Example
x2 2
5 4 3 2 1 1 1 2 2 3 3 4 4 5 5 6 6

Min z = 5x1 + 2x2 s.t. 2x1 + 5x2 > 10 4x1 - x2 > 12 x1 + x2 > 4 x1, x2 > 0

x1 + x2 > 4

4x1 - x2 > 12 1 2

2x1 + 5x2 > 10 1 2

x1 1

Example (Cont)
x2 2
5 4 3 2 1 1 1 2
A (35/11 , 8/11) B (5,0)

Min z = 5x1 + 2x2 s.t. 2x1 + 5x2 > 10 4x1 - x2 > 12 x1 + x2 > 4 x1, x2 > 0

Feasible Region This is the case of Unbounded Feasible Region.

x1 1

Example (Cont)
Objective Function : Max Z= 5x1+2x2 Corner Points A (35/11, 8/11) B (5,0) Value of Z 191/11 (17.364) 25

Optimal Point : (35/11,8/11) Optimal Value : 191/11=17.364

Example
Max z = 3x1 + 4x2 s.t. x1 + x2 > 5 3x1 + x2 > 8 x1, x2 > 0

Example

Max

z = 3x1 + 4x2 s.t. x1 + x2 > 5 3x1 + x2 > 8 x1, x2 > 0

3x1 + x2 > 8
8 5

Feasible Region This feasible region is unbounded, hence z can be increased infinitely. So this problem is having a Unbounded Solution. x1

x1 + x2 > 5

2.67

Example
Max z = 2x1 + 6x2 s.t. 4x1 + 3x2 < 12 2x1 + x2 > 8 x1, x2 > 0

Example
x2
8

Max z = 2x1 + 6x2 s.t. 4x1 + 3x2 < 12 2x1 + x2 > 8 x1, x2 > 0

2x1 + x2 > 8 4x1 + 3x2 < 12

In this example, common feasible region does not exist and hence the problem is not having a optimal solution. This is the case of infeasible solution.

3 4

x1