Session 03

• Graphical approach
Plotting the First
Constraint
MAX: 350X1 + 300X2
S.T.: 1X1 + 1X2 <= 200
LP Model for
9X1 + 6X2 <= 1566 Blue Ridge Hot
12X1 + 16X2 <= 2880 Tubs
X1 >= 0
X2 >= 0
Plotting the First Constraint
MAX: 350X1 + 300X2

S.T.: X1 + X2 <= 200

X2
9X1 + 6X2 <= 1566

250 12X1 + 16X2 <= 2880

(0, 200) X1 >= 0

200 X2 >= 0
boundary line of pump constraint
X1 + X2 = 200
150

100

50
(200, 0)

0
0 50 100 150 200 250 X1
 MAX: 350X1 + 300X2

S.T.: X1 + X2 <= 200

X2
(0, 261) 9X1 + 6X2 <= 1566
250 12X1 + 16X2 <= 2880

X1 >= 0
200 X2 >= 0
boundary line of manhours constraint
9X1 + 6X2 = 1566
150

100

50
(174, 0)
0
0 50 100 150 200 250 X1
Plotting the Second Constraint
Plotting the Third Constraint MAX: 350X1 + 300X2

S.T.: X1 + X2 <= 200

X2
9X1 + 6X2 <= 1566
250 12X1 + 16X2 <= 2880
(0, 180) X1 >= 0
200 X2 >= 0

150 boundary line of tubing constraint

12X1 + 16X2 = 2880

100

50

(240, 0)
0
0 50 100 150 200 250 X1
Plotting a Level Curve of Objective Function
MAX: 350X1 + 300X2
X2
S.T.: X1 + X2 <= 200
250 9X1 + 6X2 <= 1566

12X1 + 16X2 <= 2880

200 X1 >= 0
(0, 116.67) X2 >= 0
150 objective function
350X1 + 300X2 = 35000

100

(100, 0)
50

0
0 50 100 150 200 250 X1
Plotting a second Level Curve of Objective Function
X2

250

(0, 175) objective function

200 350X1 + 300X2 = 35000

objective function
150 350X1 + 300X2 = 52500

100

(150, 0)
50

0
0 50 100 150 200 250 X1
Using A Level Curve to Locate the Optimal Solution
X2

250

objective function
200 350X1 + 300X2 = 35000

150
Optimal
Solution objective function
100 350X1 + 300X2 = 52500

50 Feasible solution space

0
0 50 100 150 200 250 X1
Calculating the Optimal Solution • The optimal solution occurs where the “pumps” and “labor”
constraints intersect.
• This occurs where:
X1 + X2 = 200 (1)
and 9X1 + 6X2 = 1566 (2)
• From (1) we have, X2 = 200 -X1 (3)
• Substituting (3) for X2 in (2) we have,
9X1 + 6 (200 -X1) = 1566
which reduces to X1 = 122
• So the optimal solution is,
X1=122, X2=200-X1=78

Total Profit = $350*122 + $300*78 = $66,100

Enumerating The Corner Points
X2
250

200

150

100

50
obj. value = $0
(0, 0)
0
0 50 100 150 200 250 X1
Enumerating The Corner Points
X2
250
obj. value = $54,000
200 (0, 180)

150

obj. value = $66,100

100
(122, 78)

50
obj. value = $0
(0, 0)
0
0 50 100 150 200 250 X1
Enumerating The Corner Points
X2
250
obj. value = $54,000
200 (0, 180)

obj. value = $64,000

150
(80, 120)

obj. value = $66,100

100
(122, 78)

50
obj. value = $0 obj. value = $60,900
(0, 0) (174, 0)
0
0 50 100 150 200 250 X1
Note: This technique will not work if the solution is unbounded.
 1. Plot the boundary line of
each constraint

2. Identify the feasible region

Summary of
Graphical 3. Locate the optimal
Solution solution by either:
to LP Problems a. Plotting level curves

b. Enumerating the
extreme points
Understanding
How Things
Change
See file Fig2-8.xlsm
Special Conditions in
LP Models

• Several anomalies can occur in LP

problems:
• Alternate Optimal Solutions
• Redundant Constraints
• Unbounded Solutions
• Infeasibility
Example of Alternate Optimal Solutions
X2
250
objective function level curve
200 450X1 + 300X2 = 78300

150

100

alternate optimal solutions

50

0
0 50 100 150 200 250 X1
 Example of a Redundant Constraint
X2
250
boundary line of tubing constraint

200
boundary line of pump constraint
150 X1+X2<= 225

boundary line of labor constraint

100

Feasible Region
50

0
0 50 100 150 200 250 X1
Example of an Unbounded Solution
X2
1000 objective function
X1 + X2 = 600 -X1 + 2X2 = 400

800
objective function
X1 + X2 = 800

600

400

200

X1 + X2 = 400
0
-400 0 200 400 600 800 1000 X1
 Example of Infeasibility
X2
250

200 X1 + X2 >= 200

feasible region for

150 second constraint

100

feasible region
50 for first
constraint
X1 + X2 <= 150
0
0 50 100 150 200 250 X1