INSTRUCTION

Ind Objecti Activi

ex ves ty
introduct Conte
ion nt
Activi
Quiz
ty
Summ Conte
ary nt
INDEX

Example and Solution 1

Graphical
Method Example and Solution 2
Definition

Example and Solution 3

OBJECTIVES
To introduce the graphical method
To introduce how to solve a linear mathematical model using
graphical method
WHAT IS GRAPHICAL
METHOD
The graphical method is applicable to solve the LP Problem
involving two decision variables x1, and x2,
Usually take these decision variables as x, y instead of x1, x2.
WHAT IS GRAPHICAL
METHOD (CONT.)
To solve a linear programming problem involving two variables by
the graphical method, use the following steps.
 Sketch the region corresponding to the system of constraints. (The points inside
or on the boundary of the region are called feasible solutions.)
 Find the vertices of the region.
 Test the objective function at each of the vertices and select the values of the
variables that optimize the objective function. For a bounded region, both a
minimum and maximum value will exist. (For an unbounded region, if an optimal
solution exists, then it will occur at a vertex.)
WHAT IS GRAPHICAL METHOD -
EXAMPLE & SOLUTION 1

 (1)
 (2)
 (3)
WHAT IS GRAPHICAL METHOD -
EXAMPLE & SOLUTION 1 (CONT.) OABCD represents
the feasible space
x
2

 (1)
 (2) (3)
 (3) B
A
(2)

O D x
(1) 1
WHAT IS GRAPHICAL METHOD -
EXAMPLE & SOLUTION 1 (CONT.)
x
2

Z*
(3)
 (1)
A B
 (2)
(2)
 (3)
Z=
1 Optim
x* C al
Point
2
Z=
0 O D x* x
1
(1) 1
Direction of
the
maximization
 =2.8
WHAT IS GRAPHICAL METHOD -
EXAMPLE & SOLUTION 1
2 METHOD
ND Theorem 1: If an optimal solution of a LP
exists, then at least one of the corner points is
x optimal.
Corner O (0, 0) Z=0
A (0, 1.5)
2

points
Z = 1.5
B (0.75, 1.5) Z=
(3)

2.25
A B

) C (2.4, 0.4) Z = 2.8

(2

D (2, 0) Z=2
C

O D x
(1) 1
WHAT IS GRAPHICALx METHOD -
EXAMPLE & SOLUTION 2 2

Optim (3)
al
 (1) A B Point
 (2) (2)
 (3) Z=
1
C Z*

O (0, 0) Z =00 O
Z=
x
A (0, 1.5) Z
D
(1)
=3
1

B (0.75, 1.5 ) Z = 3.75

C (2.4, 0.4) Z = 3.2
D (2, 0) Z=2
WHAT IS GRAPHICAL METHOD -
EXAMPLE & SOLUTION 3
Theorem 2: If a LP has more than one optimal
x
solution, then there is an infinite number of optimal
2
solutions. All the points
of [BC] are
optimal
(3)
 A B
(1)
(2)
 (2) Z=
 (3) 4

O (0, 0) Z
C

=0
Z*
Z=
A (0, 1.5) Z
0 O D x

=9
(1) 1

B (0.75, 1.5 ) Z = 12
C (2.4, 0.4) Z = 12
D (2, 0) Z
WHAT IS GRAPHICAL METHOD - (2)
EXAMPLE & SOLUTION 4
x
2

 (1)
Infeasible Linear
 (2)
Program:
There is no solution
that satisfies all the
constraints

O x
1

(1)
WHAT IS GRAPHICAL METHOD -
EXAMPLE & SOLUTION 5 Unbounded
feasible
(1)
x
space
2

 (1)
 (2)
Unbounded
Linear Program: Z=
The objective 1 (2)
function can
always increase Z=
(maximization) 0
without violating
any constraint. x
No O
1

optimal
Problem Examples
PROBLEM 1: SOLVE
GRAPHICALLY
Max Z 8 x1  12 x2  4 x 3
s.t
20 x1  60 x2  10 x3 1500
70 x1  60 x2  15 x3 2100
12 x1  4 x2  3 x3 300
4
x1 , x2 , x3 0
? x3 100  4 x1  x2
3
EXAMPLE 1: SOLVE
GRAPHICALLY
Max Z 400
20 20
8 x 8 x x
1 x
1 2 2
3 3
s.t
140
 20 x1  x2 500
3
10 x1  40 x2 600
4
4 x1  x2 100
30
x1 , x2 
x1 , x2 0
EXAMPLE 1: GRAPHICAL
SOLUTION
EXAMPLE 2: SOLVE
GRAPHICALLY
Formulatio n P
Max Z  x1  3 x2  4 x3  8 x4
s.t
x1  x2 3
x3  3 x4 5
x1 , x2 , x3 , x4 0
EXAMPLE 2: SOLVE
GRAPHICALLY
Formulatio n P 1 Formulatio n P 2
Max Z1  x1  3 x2 Max Z 2 4 x3  8 x4
s.t s.t
x1  x2 3 x3  3 x4 5
x1 , x2 0 x3 , x4 0

Z *
Z *
1 Z *
2
EXAMPLE If3we add the following constrain t to P :
x1  3 x3 0
Max Z  x1  3 x2  4 x3  8 x4
s.t
x1  x2 3
x1  3 x3 0 Redundant
x3  3 x4 5 constraint
x1 , x2 , x3 , x4 0
SUMMARY
In this unit we have learnt about:
 Graphical method
 How to solve linear mathematical model using graphical method
 Some problem set according to the graphical method
 ACTIVITY

Activity Unit 2 - Graphical Method

UNIT 9 - GRAPHICAL
METHOD

23