Ch 11 Resource Constraints
and Linear Programming
The process of finding an optimum
outcome from a set of constrained
resources, where the objective
function and the constraints can be
expressed as linear equations.
Drawing the Linear Model
Standard Graph
0
500
1000
1500
2000
2500
0 500 1000 1500 2000 2500
Number of X units
Number of Y units
Adding the Linear Constraints
Standard Graph: Constraints Added
0
500
1000
1500
2000
2500
0 500 1000 1500 2000 2500
Number of X units
Number of Y units
Feasible
Region
Adding the Iso-Contribution Line
The iso-contribution line is a ‘slope’ which represents the objective function.
It is drawn as a generic line, then ‘floated’ to an optimum location within the
feasible region.
Partial Graph: Notional Iso-Contribution
Line, and Constraints.
0
500
1000
1500
2000
2500
0 500 1000 1500 2000 2500
Number of X units
Number of Y unit
Constraint 1
Constraint 2
Constraint 3
Iso
Contribution
Line
Finding the Optimum Point
Float the iso-contribution line to an optimum position.
Finished Graph:
Optimum Iso-Contribution Line Floated
Into Postion Against the Binding
Constraints.
0
500
1000
1500
2000
2500
0 500 1000 1500 2000 2500
Number of X units
Number of
units
Constraint 1
Constraint 2
Constraint 3
Iso Contribution
Line
Optimum Iso
Contribution Line
Optimum point.