Graphical Solution: OR by Soumitra Chakraborty
Graphical Solution: OR by Soumitra Chakraborty
OR by Soumitra Chakraborty
GRAPHICAL SOLUTION OF LINEAR PROGRAMMING
MODELS
60
50
40
30
20
Coordinates
for graphical
10
analysis
0 10 20 30 40 50 60
GRAPHICAL REPRESENTATION OF CONSTRAINT
1x1 + 2x2 40
Intercepts
ntercepts
(X1 = 0, X2 = 20)
(X1 = 40, X2 = 0)
• 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
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