Graphical Solution

OR by Soumitra Chakraborty
GRAPHICAL SOLUTION OF LINEAR PROGRAMMING
MODELS

Graphical solution is limited to linear programming

models containing only two decision variables (can be
used with three variables but only with great
difficulty).
Graphical methods provide visualization of how a
solution for a linear programming problem is
obtained.
 Primary advantage of two-variable LP models (such as
Beaver Creek problem) is their solution can be graphically
illustrated using two-dimensional graph.
 Allows one to provide an intuitive explanation of how
more complex solution procedures work for larger LP
models.
 GRAPHICAL REPRESENTATION OF LP MODELS

60

50

40

30

20
Coordinates
for graphical
10
analysis

0 10 20 30 40 50 60
GRAPHICAL REPRESENTATION OF CONSTRAINT

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0

Coordinates for Graphical Analysis

Chart
LABOR CONSTRAINT

1x1 + 2x2  40
Intercepts
ntercepts
(X1 = 0, X2 = 20)
(X1 = 40, X2 = 0)

Graph of Labor Constraint

LABOR CONSTRAINT AREA

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0

Labor Constraint Area

CLAY CONSTRAINT AREA

4x1 + 3x2  120

Intercepts
(X1 = 0, X2 = 40)
(X1 = 30, X2 = 0)

Clay Constraint Area

GRAPHICAL REPRESENTATION OF CONSTRAINTS:

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0

Graph of Both Model Constraints

 FEASIBLE SOLUTION AREA:

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0

Feasible Solution Area

CORNER POINT PROPERTY

It is a very important property of Linear

Programming problems:

This property states optimal solution to LP problem

will always occur at a corner point.
GRAPHICAL SOLUTION - CORNER
POINT SOLUTION METHOD :

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0

Solution at All Corner Points

Example LP Model Formulation:
The Product Mix Problem
Decision: How much to make of > 2 products?

Objective: Maximize profit

Constraints: Limited resources

Example: ABC Furniture Co.
Two products: Chairs and Tables

Decision: How many of each to make this month?

Objective: Maximize profit

ABC Furniture Co. Data
Tables Chairs
(per table) (per chair)
Profit Hours
Rs 6 Rs 5
Contribution Available
Carpentry 1 hrs 1 hrs 5
Painting 3 hrs 2 hr 12
Decision Variables:
X1 = Num. of tables to make
X2 = Num. of chairs to make

Objective Function: Maximize Profit

Maximize Z=6X1 + 5X2
Constraints:
• Have 5 hours of carpentry time available
X1 + X2 < 5 (hours)
• Have 12 hours of painting time available
3X1 + 2X2 < 12 (hours)
Nonnegativity:
Cannot make a negative number of chairs or tables
X1 > 0
X1 > 0
Model Summary
Max Z=6 X1 + 5 X2 (profit)
Subject to the constraints:
X1 + X2 < 5 (carpentry hrs)
3 X1 + 2 X2 < 12 (painting hrs)
X1 , X2 > 0 non negativity)
Graphical Solution
• Graphing an LP model helps provide insight into LP models and their
solutions.

• While this can only be done in two dimensions, the same properties
apply to all LP models and solutions.
Carpentry C
Constraint Line
X1 + X2 < 5 6
Infeasible
> 5 hrs

5
X
Intercepts 1
+
X
<
(X1 = 0, X2 = 5) 2
5
Feasible
(X1 = 5, X2 = 0) < 5 hrs
0
0 5 6 T
Painting C
Painting line Line
3X1 + 2 X2 < 12 6

5
3X
Intercepts 1
+
2
X
(X1 = 0, X2 = 6) 2 <
12
Feasible
(X1 = 4, X2 = 0) < 5 hrs
0
0 4 5 6 T
LP Characteristics
• Feasible Region: The set of points that satisfies all constraints
• Corner Point Property: An optimal solution must lie at one or more
corner points
• Optimal Solution: The corner point with the best objective function
value is optimal
Painting C
Painting line Line
3X1 + 2 X2 < 12 6

5
3X
Intercepts 1
+
2
X
(X1 = 0, X2 = 6) 2 <
12
Feasible
(X1 = 4, X2 = 0) < 5 hrs
0
0 4 5 6 T
Minimization Problem
Min Z=3 X1 + 2 X2
Subject to the constraints:
5 X1 + X2 > 10
X1 + X2 > 6
X1 + 4X2 > 12
X1 , X2 > 0 non negativity)
Mixed Constraints
Min Z=200 X1 + 400 X2
Subject to the constraints:
X1 + X2 > 200
X1 + 3 X2 > 400
X1 + 2 X2 < 350

X1 , X2 > 0 non negativity)

Special Situation in LP
1. Redundant Constraints - do not affect the feasible region

Example: x < 10
x < 12
The second constraint is redundant because it is less restrictive.
Special Situation in LP
2. Infeasibility – when no feasible solution exists (there is no feasible
region)

Example: x < 10
x > 15
Special Situation in LP
3. Alternate Optimal Solutions – when there is more than one optimal solution

2
X1
Max 2 X1 + 2 X2 10

+
2
Subject to: All points on

X2
=
X1 + X2 < 10

20
6 Red segment
X1 < 5 are optimal
X2 < 6
X1, X2 > 0
0

0 5 10 T
Special Situation in LP
4. Unbounded Solutions – when nothing prevents the solution from becoming infinitely large

C io n
ct ion
Max 2 X1 + 2 X2 ire lut
D so
Subject to: 2 of
2 X1 + 3 X2 > 6
1
X1, X2 > 0
0

0 1 2 3 T