Linear Programming

Introduction
n Many management decisions involve
trying to make the most effective use of
limited resources.
n Linear programming (LP) is a widely used
mathematical modeling technique
designed to help managers in planning and
decision making relative to resource
allocation.
n This belongs to the broader field of
mathematical programming.
n In this sense, programming refers to modeling
and solving a problem mathematically.
7-2
LP Properties and Assumptions

PROPERTIES OF LINEAR PROGRAMS

1. One objective function
2. One or more constraints
3. Alternative courses of action
4. Objective function and constraints are linear
– proportionality and divisibility
5. Certainty
6. Divisibility
7. Nonnegative variables

7-3
 Formulating LP Problems
n Formulating a linear program involves developing
a mathematical model to represent the managerial
problem.
n The steps in formulating a linear program are:
1. Completely understand the managerial
problem being faced.
2. Identify the objective and the constraints.
3. Define the decision variables.
4. Use the decision variables to write
mathematical expressions for the objective
function and the constraints.

7-4
 Flair Furniture Company
n The Flair Furniture Company produces
inexpensive tables and chairs.
n Processes are similar in that both require a certain
amount of hours of carpentry work and in the
painting and varnishing department.
n Each table takes 4 hours of carpentry and 2 hours
of painting and varnishing.
n Each chair requires 3 of carpentry and 1 hour of
painting and varnishing.
n There are 240 hours of carpentry time available
and 100 hours of painting and varnishing.
n Each table yields a profit of $70 and each chair a
profit of $50.
7-5
 Flair Furniture Company Data
The company wants to determine the best
combination of tables and chairs to produce to reach
the maximum profit.

HOURS REQUIRED TO
PRODUCE 1 UNIT
(T) (C) AVAILABLE HOURS
DEPARTMENT TABLES CHAIRS THIS WEEK
Carpentry 4 3 240

Painting and varnishing 2 1 100

Profit per unit $70 $50

7-6
 Flair Furniture Company
n The objective is to:
Maximize profit
n The constraints are:
1. The hours of carpentry time used cannot
exceed 240 hours per week.
2. The hours of painting and varnishing time
used cannot exceed 100 hours per week.
n The decision variables representing the actual
decisions we will make are:
T = number of tables to be produced per week.
C = number of chairs to be produced per week.

7-7
 Flair Furniture Company

n We create the LP objective function in terms of T

and C:
Maximize profit = $70T + $50C
n Develop mathematical relationships for the two
constraints:
n For carpentry, total time used is:
(4 hours per table)(Number of tables produced)
+ (3 hours per chair)(Number of chairs produced).
n We know that:
Carpentry time used ≤ Carpentry time available.
4T + 3C ≤ 240 (hours of carpentry time)

7-8
 Flair Furniture Company
n Similarly,
Painting and varnishing time used
≤ Painting and varnishing time available.
2 T + 1C ≤ 100 (hours of painting and varnishing time)

This means that each table produced

requires two hours of painting and
varnishing time.

n Both of these constraints restrict production

capacity and affect total profit.

7-9
 Flair Furniture Company
The values for T and C must be nonnegative.
T ≥ 0 (number of tables produced is greater
than or equal to 0)
C ≥ 0 (number of chairs produced is greater
than or equal to 0)

The complete problem stated mathematically:

Maximize profit = $70T + $50C
subject to
4T + 3C ≤ 240 (carpentry constraint)
2T + 1C ≤ 100 (painting and varnishing constraint)
T, C ≥ 0 (nonnegativity constraint)

7-10
 Graphical Solution to an LP Problem

n The easiest way to solve a small LP

problems is graphically.
n The graphical method only works when
there are just two decision variables.
n When there are more than two variables, a
more complex approach is needed as it is
not possible to plot the solution on a two-
dimensional graph.
n The graphical method provides valuable
insight into how other approaches work.

7-11
 Graphical Representation of a
Constraint
Quadrant Containing All Positive Values
C

100 –
– This Axis Represents the Constraint T ≥ 0
80 –
Number of Chairs

–
60 –
–
40 – This Axis Represents the
– Constraint C ≥ 0
20 –
–
|– | | | | | | | | | | |
0 20 40 60 80 100 T
Number of Tables
7-12
 Graphical Representation of a
Constraint

n The first step in solving the problem is to

identify a set or region of feasible
solutions.
n To do this we plot each constraint
equation on a graph.
n We start by graphing the equality portion
of the constraint equations:
4T + 3C = 240
n We solve for the axis intercepts and draw
the line.

7-13
 Graphical Representation of a
Constraint
n When Flair produces no tables, the
carpentry constraint is:
4(0) + 3C = 240
3C = 240
C = 80
n Similarly for no chairs:
4T + 3(0) = 240
4T = 240
T = 60
n This line is shown on the following graph:

7-14
Graphical Representation of a
Constraint
Graph of carpentry constraint equation
C

100 –
–
80 – (T = 0, C = 80)
Number of Chairs

–
60 –
–
40 –
–
(T = 60, C = 0)
20 –
–
|– | | | | | | | | | | |
0 20 40 60 80 100 T
Number of Tables 7-15
 Graphical Representation of a
Constraint
Region that Satisfies the Carpentry Constraint
C
n Any point on or below
100 – the constraint plot will
– not violate the
80 – restriction.
Number of Chairs

– n Any point above the

60 –
plot will violate the
restriction.
–
(30, 40) (70, 40)
40 –
–
20 –
– (30, 20)
|– | | | | | | | | | | |
0 20 40 60 80 100 T
Number of Tables
7-16
 Graphical Representation of a
Constraint

n The point (30, 40) lies on the plot and

exactly satisfies the constraint
4(30) + 3(40) = 240.
n The point (30, 20) lies below the plot and
satisfies the constraint
4(30) + 3(20) = 180.
n The point (70, 40) lies above the plot and
does not satisfy the constraint
4(70) + 3(40) = 400.

7-17
Graphical Representation of a
Constraint
Region that Satisfies the Painting and
Varnishing Constraint
C

100 – (T = 0, C = 100)
–
80 –
Number of Chairs

–
60 –
–
40 –
–
(T = 50, C = 0)
20 –
–
|– | | | | | | | | | | |
0 20 40 60 80 100 T
Number of Tables 7-18
 Graphical Representation of a
Constraint

n To produce tables and chairs, both

departments must be used.
n We need to find a solution that satisfies both
constraints simultaneously.
n A new graph shows both constraint plots.
n The feasible region (or area of feasible
solutions) is where all constraints are satisfied.
n Any point inside this region is a feasible
solution.
n Any point outside the region is an infeasible
solution.

7-19
Graphical Representation of a
Constraint
Feasible Solution Region for the Flair
Furniture Company Problem
C

100 –
–
80 –
Number of Chairs

Painting/Varnishing Constraint
–
60 –
–
40 –
–
Carpentry Constraint
20 – Feasible
– Region
|– | | | | | | | | | | |
0 20 40 60 80 100 T
Number of Tables
7-20
 Graphical Representation of a
Constraint
n For the point (30, 20)
Carpentry 4T + 3C ≤ 240 hours available
constraint (4)(30) + (3)(20) = 180 hours used ü
Painting 2T + 1C ≤ 100 hours available
constraint (2)(30) + (1)(20) = 80 hours used
ü

n For the point (70, 40)

Carpentry 4T + 3C ≤ 240 hours available
constraint (4)(70) + (3)(40) = 400 hours used û
Painting 2T + 1C ≤ 100 hours available
constraint (2)(70) + (1)(40) = 180 hours used û

7-21
 Graphical Representation of a
Constraint
n For the point (50, 5)
Carpentry 4T + 3C ≤ 240 hours available
constraint (4)(50) + (3)(5) = 215 hours used ü
Painting 2T + 1C ≤ 100 hours available
constraint (2)(50) + (1)(5) = 105 hours used û

7-22
 Isoprofit Line Solution Method
n Once the feasible region has been graphed, we
need to find the optimal solution from the many
possible solutions.
n The speediest way to do this is to use the isoprofit
line method.
n Starting with a small but possible profit value, we
graph the objective function.
n We move the objective function line in the
direction of increasing profit while maintaining the
slope.
n The last point it touches in the feasible region is
the optimal solution.

7-23
 Isoprofit Line Solution Method
n For Flair Furniture, choose a profit of $2,100.
n The objective function is then
$2,100 = 70T + 50C
n Solving for the axis intercepts, we can draw the
graph.
n This is obviously not the best possible solution.
n Further graphs can be created using larger profits.
n The further we move from the origin, the larger the
profit will be.
n The highest profit ($4,100) will be generated when
the isoprofit line passes through the point (30, 40).

7-24
Isoprofit Line Solution Method
Profit line of $2,100 Plotted for the Flair
C
Furniture Company

100 –
–
80 –
Number of Chairs

–
60 –
– $2,100 = $70T + $50C
(0, 42)
40 –
–
(30, 0)
20 –
–
|– | | | | | | | | | | |
0 20 40 60 80 100 T
Number of Tables 7-25
Isoprofit Line Solution Method
Four Isoprofit Lines Plotted for the Flair
Furniture Company
C

100 –
–
$3,500 = $70T + $50C
80 –
Number of Chairs

– $2,800 = $70T + $50C

60 –
– $2,100 = $70T + $50C
40 –
– $4,200 = $70T + $50C
20 –
–
|– | | | | | | | | | | |
0 20 40 60 80 100 T
Number of Tables 7-26
Isoprofit Line Solution Method
Optimal Solution to the Flair Furniture problem
C

100 –
–
80 –
Number of Chairs

Maximum Profit Line

–
60 – Optimal Solution Point
– (T = 30, C = 40)
40 –
– $4,100 = $70T + $50C
20 –
–
|– | | | | | | | | | | |
0 20 40 60 80 100 T
Number of Tables 7-27
 Corner Point Solution Method
n A second approach to solving LP problems
employs the corner point method.
n It involves looking at the profit at every
corner point of the feasible region.
n The mathematical theory behind LP is that
the optimal solution must lie at one of the
corner points, or extreme point, in the
feasible region.
n For Flair Furniture, the feasible region is a
four-sided polygon with four corner points
labeled 1, 2, 3, and 4 on the graph.
7-28
Corner Point Solution Method
Four Corner Points of the Feasible Region
C

100 –
2 –
80 –
Number of Chairs

–
60 –
–
3
40 –
–
20 –
–
1 |– | | | | | | | | | | |
0 20 40 60 80 100 T
4
Number of Tables
7-29
 Corner Point Solution Method
n To find the coordinates for Point 3 accurately we have to
solve for the intersection of the two constraint lines.
n Using the simultaneous equations method, we multiply the
painting equation by –2 and add it to the carpentry equation
4T + 3C = 240 (carpentry line)
– 4T – 2C = –200 (painting line)
C = 40

n Substituting 40 for C in either of the original equations

allows us to determine the value of T.
4T + (3)(40) = 240 (carpentry line)
4T + 120 = 240
T = 30
7-30
 Corner Point Solution Method
Point 1 : (T = 0, C = 0) Profit = $70(0) + $50(0) = $0
Point 2 : (T = 0, C = 80) Profit = $70(0) + $50(80) = $4,000
Point 4 : (T = 50, C = 0) Profit = $70(50) + $50(0) = $3,500
Point 3 : (T = 30, C = 40) Profit = $70(30) + $50(40) = $4,100

Because Point 3 returns the highest profit, this is

the optimal solution.

7-31
 Slack and Surplus

n Slack is the amount of a resource

that is not used. For a less-than-or-
equal constraint:
n Slack = Amount of resource available –
amount of resource used.
n Surplus is used with a greater-than-
or-equal constraint to indicate the
amount by which the right hand side
of the constraint is exceeded.
n Surplus = Actual amount – minimum
amount. 7-32
Solving Minimization Problems
n Many LP problems involve minimizing an objective
such as cost instead of maximizing a profit
function.
n Minimization problems can be solved graphically
by first setting up the feasible solution region and
then using either the corner point method or an
isocost line approach (which is analogous to the
isoprofit approach in maximization problems) to
find the values of the decision variables (e.g., X1
and X2) that yield the minimum cost.

7-33
 Holiday Meal Turkey Ranch
The Holiday Meal Turkey Ranch is considering
buying two different brands of turkey feed and
blending them to provide a good, low-cost diet for its
turkeys
Let
X1 = number of pounds of brand 1 feed purchased
X2 = number of pounds of brand 2 feed purchased

Minimize cost (in cents) = 2X1 + 3X2

subject to:
5X1 + 10X2 ≥ 90 ounces (ingredient constraint A)
4X1 + 3X2 ≥ 48 ounces (ingredient constraint B)
0.5X1 ≥ 1.5 ounces (ingredient constraint C)
X1 ≥ 0 (nonnegativity constraint)
X2 ≥ 0 (nonnegativity constraint)
7-34
 Holiday Meal Turkey Ranch
Holiday Meal Turkey Ranch data

COMPOSITION OF EACH POUND

OF FEED (OZ.) MINIMUM MONTHLY
REQUIREMENT PER
INGREDIENT BRAND 1 FEED BRAND 2 FEED TURKEY (OZ.)
A 5 10 90
B 4 3 48
C 0.5 0 1.5
Cost per pound 2 cents 3 cents

7-35
Feasible Region for the Holiday
Meal Turkey Ranch Problem
X2
–

20 –
Ingredient C Constraint
Pounds of Brand 2

15 –
Feasible Region

a
10 –
Ingredient B Constraint
5–
b Ingredient A Constraint

0 |– | | | c | |
5 10 15 20 25 X1
Pounds of Brand 1 7-36
 Holiday Meal Turkey Ranch
n Solve for the values of the three corner points.
n Point a is the intersection of ingredient constraints
C and B.
4X1 + 3X2 = 48
X1 = 3
n Substituting 3 in the first equation, we find X2 = 12.
n Solving for point b with basic algebra we find X1 =
8.4 and X2 = 4.8.
n Solving for point c we find X1 = 18 and X2 = 0.

7-37
 Holiday Meal Turkey Ranch
Substituting these value back into the objective
function we find

Cost = 2X1 + 3X2

Cost at point a = 2(3) + 3(12) = 42
Cost at point b = 2(8.4) + 3(4.8) = 31.2
Cost at point c = 2(18) + 3(0) = 36

The lowest cost solution is to purchase 8.4 pounds

of brand 1 feed and 4.8 pounds of brand 2 feed for a
total cost of 31.2 cents per turkey.

7-38
 Holiday Meal Turkey Ranch
Graphical Solution to the Holiday Meal Turkey Ranch
Problem Using the Isocost Approach
X2
–
Feasible Region

20 –
Pounds of Brand 2

15 – 54
¢=
Di 2X
re 1 +
cti 3X
10 – on
of 2 Is
31 De oc
.2¢ cr os
e tL
=2 as ine
5– X i ngC
1 +
3X os
2 t
(X1 = 8.4, X2 = 4.8)
0–| | | | | |
5 10 15 20 25 X1
Pounds of Brand 1 7-39
 Four Special Cases in LP
No feasible solution
n This exists when there is no solution to the
problem that satisfies all the constraint
equations.
n No feasible solution region exists.
n This is a common occurrence in the real world.
n Generally one or more constraints are relaxed
until a solution is found.

7-40
Four Special Cases in LP
A problem with no feasible solution
X2

8–
–
6–
–
Region Satisfying
4– Third Constraint
–
2–
–
0– | | | | | | | | | |
2 4 6 8 X1

Region Satisfying First Two Constraints

7-41
 Four Special Cases in LP
Unboundedness
n Sometimes a linear program will not have a
finite solution.
n In a maximization problem, one or more
solution variables, and the profit, can be made
infinitely large without violating any
constraints.
n In a graphical solution, the feasible region will
be open ended.
n This usually means the problem has been
formulated improperly.

7-42
 Four Special Cases in LP
A Feasible Region That is Unbounded to the Right
X2

X1 ≥ 5
15 –

X2 ≤ 10
10 –

Feasible Region
5–
X1 + 2X2 ≥ 15

0 |– | | | |
5 10 15 X1

7-43
 Four Special Cases in LP
Redundancy
n A redundant constraint is one that does not
affect the feasible solution region.
n One or more constraints may be binding.
n This is a very common occurrence in the real
world.
n It causes no particular problems, but
eliminating redundant constraints simplifies
the model.

7-44
Four Special Cases in LP
Problem with a Redundant Constraint
X2
30 –

25 –
2X1 + X2 ≤ 30
20 –
Redundant
Constraint
15 –
X1 ≤ 25

10 –
X1 + X2 ≤ 20
Feasible
5–
Region

0– | | | | | |
5 10 15 20 25 30 X1
7-45
 Four Special Cases in LP

Alternate Optimal Solutions

n Occasionally two or more optimal solutions
may exist.
n Graphically this occurs when the objective
function’s isoprofit or isocost line runs
perfectly parallel to one of the constraints.
n This actually allows management great
flexibility in deciding which combination to
select as the profit is the same at each
alternate solution.

7-46
Four Special Cases in LP
Example of Alternate Optimal Solutions
X2
8–

7–

6 –A
Optimal Solution Consists of All
5– Combinations of X1 and X2 Along
the AB Segment
4–

3– Isoprofit Line for $8

2–
B Isoprofit Line for $12
1 – Feasible Overlays Line Segment AB
Region
0– | | | | | | | |
1 2 3 4 5 6 7 8 X1
7-47
 Sensitivity Analysis
n Optimal solutions to LP problems thus far have
been found under what are called deterministic
assumptions.
n This means that we assume complete certainty in
the data and relationships of a problem.
n But in the real world, conditions are dynamic and
changing.
n We can analyze how sensitive a deterministic
solution is to changes in the assumptions of the
model.
n This is called sensitivity analysis, postoptimality
analysis, parametric programming, or optimality
analysis.

7-48
 Sensitivity Analysis
n Sensitivity analysis often involves a series of
what-if? questions concerning constraints,
variable coefficients, and the objective function.
n One way to do this is the trial-and-error method
where values are changed and the entire model is
resolved.
n The preferred way is to use an analytic
postoptimality analysis.
n After a problem has been solved, we determine a
range of changes in problem parameters that will
not affect the optimal solution or change the
variables in the solution.

7-49
 High Note Sound Company
n The High Note Sound Company manufactures
quality CD players and stereo receivers.
n Products require a certain amount of skilled
artisanship which is in limited supply.
n The firm has formulated the following product mix
LP model.
Maximize profit = $50X1 + $120X2
Subject to 2X1 + 4X2 ≤ 80 (hours of electrician’s
time available)
3X1 + 1X2 ≤ 60 (hours of audio
technician’s time
available)
X1 , X2 ≥ 0

7-50
 High Note Sound Company
The High Note Sound Company Graphical Solution
X2
(receivers)
60 –

– Optimal Solution at Point a

X1 = 0 CD Players
40 – X2 = 20 Receivers
Profits = $2,400
a = (0, 20) –
b = (16, 12)
20 –
Isoprofit Line: $2,400 = 50X1 + 120X2
10 –

0– | | | | | |
10 20 30 40 50 60 X1
c = (20, 0) (CD players)
7-51
 Changes in the
Objective Function Coefficient

n In real-life problems, contribution rates in the

objective functions fluctuate periodically.
n Graphically, this means that although the feasible
solution region remains exactly the same, the
slope of the isoprofit or isocost line will change.
n We can often make modest increases or
decreases in the objective function coefficient of
any variable without changing the current optimal
corner point.
n We need to know how much an objective function
coefficient can change before the optimal solution
would be at a different corner point.

7-52
 Changes in the
Objective Function Coefficient
Changes in the Receiver Contribution Coefficients
X2
40 –
Profit Line for 50X1 + 80X2
(Passes through Point b)
30 –
Old Profit Line for 50X1 + 120X2
(Passes through Point a)
20 –
b
a Profit Line for 50X1 + 150X2
10 – (Passes through Point a)

0– | | c | | | |
10 20 30 40 50 60 X1

7-53
 Changes in the
Technological Coefficients

n Changes in the technological coefficients often

reflect changes in the state of technology.
n If the amount of resources needed to produce a
product changes, coefficients in the constraint
equations will change.
n This does not change the objective function, but
it can produce a significant change in the shape
of the feasible region.
n This may cause a change in the optimal solution.

7-54
 Changes in the
Technological Coefficients
Change in the Technological Coefficients for the
High Note Sound Company

(a) Original Problem (b) Change in Circled (c) Change in Circled

Coefficient Coefficient
X2 X2 X2
60 – 60 – 60 –
Stereo Receivers

3X1 + 1X2 ≤ 60 2 X1 + 1X2 ≤ 60 3X1 + 1X2 ≤ 60

40 – 40 – 40 –
Optimal Still Optimal
Solution Optimal Solution
20 –a 20 –a 20 –
d
b 2X1 + 4X2 ≤ 80 2X1 + 4X2 ≤ 80 16 f g 2X1 + 5 X2 ≤ 80
– |c | | – | e | | | – |c | |
0 20 40 X1 0 20 30 40 X1 0 20 40 X1
CD Players

7-55
 Changes in Resources or
Right-Hand-Side Values
n The right-hand-side values of the
constraints often represent resources
available to the firm.
n If additional resources were available, a
higher total profit could be realized.
n Sensitivity analysis about resources will
help answer questions about how much
should be paid for additional resources
and how much more of a resource would
be useful.

7-56
 Changes in Resources or
Right-Hand-Side Values
n If the right-hand side of a constraint is changed,
the feasible region will change (unless the
constraint is redundant).
n Often the optimal solution will change.
n The amount of change in the objective function
value that results from a unit change in one of the
resources available is called the dual price or dual
value .
n The dual price for a constraint is the improvement
in the objective function value that results from a
one-unit increase in the right-hand side of the
constraint.

7-57
 Changes in Resources or
Right-Hand-Side Values
n However, the amount of possible increase in the
right-hand side of a resource is limited.
n If the number of hours increased beyond the
upper bound, then the objective function would no
longer increase by the dual price.
n There would simply be excess (slack) hours of a
resource or the objective function may change by
an amount different from the dual price.
n The dual price is relevant only within limits.

7-58
Changes in the Electricians’ Time Resource
for the High Note Sound Company

X2 (a)
60 –

40 –
Constraint Representing 60 Hours of
Audio Technician’s Time Resource
a
25 –
20 – b Changed Constraint Representing 100 Hours
of Electrician’s Time Resource

– | c | | |
0 20 40 50 60 X1

7-59
Changes in the Electricians’ Time Resource
for the High Note Sound Company

X2 (b)
60 –

40 –
Constraint Representing 60 Hours of
Audio Technician’s Time Resource

20 – Changed Constraint Representing 60 Hours

a of Electrician’s Time Resource
15 –
b
– c | | | |
0 20 30 40 60 X1

7-60
Changes in the Electricians’ Time Resource
for the High Note Sound Company

X2 (c)
60 –
Changed Constraint Representing 240 Hours
of Electrician’s Time Resource

40 –

Constraint
Representing
20 – 60 Hours of Audio
Technician’s
Time Resource

– | | | | | |
0 20 40 60 80 100 120
X1

7-61