Graphical Method

Graphical study of an LP
Study the problem by plotting its graph.

Can solve LPs with only two variables (Why?)

More a tool for learning concepts of LP than a

solution method.

Gives us insight into problem and the solution

method.

Helps us understand basic concepts involved in the

solution procedure.
 Beaver
Creek
Pottery
Example

RESOURCE REQUIREMENTS

Labor Clay Revenue

PRODUCT (hr/unit) (lb/unit) ($/unit)
Bowl 1 4 40
Mug 2 3 50

There are 40 hours of labor and 120 pounds of clay

available each day
 Beaver Creek Pottery Example

40 hrs of labor per day

Resource Availability:
120 lbs of clay

x1 = number of bowls to produce per day

Decision Variables:
x2 = number of mugs to produce per day

Maximize Z = $40x1 + $50x2

Objective Function:
Where Z = profit per day

1x1 + 2x2  40 hours of labor

Constraints:
4x1 + 3x2  120 pounds of clay
Non-Negativity
x1  0; x2  0
Constraints:
 LP Formulation: Beaver Creek
Maximize Z = 40 x1 + 50 x2

Subject to
x1 + 2x2  40 hr (labor constraint)
4x1+ 3x2  120 lb (clay constraint)
x1 , x 2  0
 Graphical Solution Method

1. Draw all the constraints one by one in a

coordinate plane
2. Identify the feasible solution space on the graph
where all constraints are satisfied simultaneously
3. Plot objective function on this space by giving
different values to the objective function
4. Find the point(s) that maximize (or minimize)
value of objective function
 Graphical Solution: Example
x2
50

40
4x1 + 3x2  120

30
Area common to
both constraints
20
Optimal solution

10 x1 + 2x2  40

| | | | | | x1
10 20 30 40 50 60
 Computing Optimal Values
x2 x1 + 2x2 = 40
4x1 + 3x2 = 120
50
4x1 + 8x2 = 160
-4x1 - 3x2 = -120
40
5x2 = 40
x2 = 8
30

x1 + 2(8) = 40
20
x1 = 24

10 Z = $40(24) + $50(8) = $1,360

| | | | | | x1
10 20 30 40 50 60
 Extreme Corner Points

x1 = 0 bowls
x2 x2 = 20 mugs
x1 = 24 bowls
Z = $1,000
40 – x2 = 8 mugs
Z = $1,360 x1 = 30 bowls
30 – x2 = 0 mugs
20 – A
Z = $1,200

10 –
B
0– | | | C|
10 20 30 40 x1
Summary of Graphical Method
Draw the constraint lines and identify the solution
space (feasible region).

Draw the line corresponding to objective function

for an appropriate value so that it passes through
the feasible region.

Move this line parallel to itself, in the direction of

improving the objective function, as far as possible
without stepping outside the feasible region.

The point(s) of the feasible region last contacted

with the objective function line is(are) the optimal
solution.
 Definitions
Solution: Any point in the x-y plane satisfying the
constraints.

Feasible Solution: A solution satisfying non-negativity.

Solution Space/Feasible Region: Set of all feasible

solutions.

Optimal Solution: Feasible solution yielding the best

value of objective function.
 Observations
For LP optimal solution always lies at a boundary point.

Optimal point may not be unique.

Whenever optimal solution is not unique, we have

infinite number of optimal solutions.

Solution space may not be bounded.

An LP may have unbounded solution i.e. objective

function can be made arbitrarily large in maximization
case and arbitrarily small in case of minimization.

An LP may not have a solution at all.

 Unique Optimal Solution: Only one corner point is the
optimal solution
X2

Optimal solution Max 4x1+5x2

Subject to x1+ x2 ≤8
2x1 -x2 ≤7
x2 ≤4
x1, x2 ≥0

Plot the graph of x1+x2 ≤ 8

X1
Plot the graph of 2x1-x2 ≤ 7

Plot the graph of x2 ≤ 4

Plot the graph of x1, x2 ≥ 0

Objective function: 4x1+5x2

 Alternate Solutions: When an edge/face is parallel to the
objective function line/plane and it improves in that direction.
X2

Alternate Optimal Solutions Max 4x1+4x2

Subject to x1+ x2 ≤8
2x1 -x2 ≤7
x2 ≤4
x1, x2 ≥0

X1
 Unbounded LP: Objective Function can be improved indefinitely
without violating any constraints.
X2

Max 4x1+5x2
Subject to x1+ x2 ≥8
2x1 -x2 ≥7
x2 ≤4
x1, x2 ≥0

X1

Unbounded Optimal
solution
 Unbounded region but unique optimal solution

X2

Min 4x1+5x2
Subject to x1+ x2 ≥8
2x1 -x2 ≥7
x2 ≤4
x1, x2 ≥0

X1

Unbounded Region but

Bounded Optimal Solution
 Infeasible LP: No feasible region. It is impossible to find a solution
that satisfies all constraints (including non negativity)
X2 simultaneously
Max 4x1+5x2
Subject to x1+ x2 ≥8
Infeasible Solution 2x1 -x2 ≤7
x2 ≤2
x1, x2 ≥0

X1
 Problems (Practice)
Maximize x1 + 2x2 Maximize 4x1 + 9x2
Subject to: x1 + x2 ≤ 8 Subject to: -x1 + 3x2 ≥ 1
-x1+ x2 ≤ 7 x1 - 2x2 ≥ 1
3x1-2x2 ≤ 4 x1, x2 ≥ 0
x1, x2 ≥ 0

Minimize 4(x1 + 2x2) Minimize 4(x1 + 2x2) +7

Subject to: 3x1 + x2 ≤ -2 Subject to: 3x1 + x2 ≤ 6
x1 + x2 ≤ 1/2 x1 + x2 ≤ 6
x1, x2 ≥ 0 x1, x2 ≥ 0
 Solutions

1) (.5, 7.5), Optimal Value = 15.5

2) The solution is unbounded
3) There is no feasible solution
4) (0,6), Optimal Value = 55
 Problem (Practice)
Maximize -2x1 + x2
Subject to: -3x1 + x2 ≤6
x1 - 2x2 ≤4
x1 - x2 ≥ -1
x1, x2 ≤0