In this lesson you will learn the
following:
1. Translate descriptive statements into
mathematical models
2. Formulate a linear model for a given
linear optimization problems
3. Determine the optimal solution of a
linear programming model using
graphical method and excel application
Things you need to learn:
Finding the solution set of systems of
linear equations
Sketching the graph of linear inequalities
Finding the solution set of linear
inequalities
Problem
The ABC Furniture makes two products: tables
and chairs which must be processed through
assembly and finishing departments. Assembly
department is available for 60 hours, in every
production period, while finishing department is
available 48 hours of work. Manufacturing one
table requires 4hours in the assembly line and 2
hours in finishing. Each chair 2 hours in the
assembly line and 4 hours in finishing. One table
contributes P80 profit, while a chair contributes P
60. The problem is to determine the number of
tables and chairs to make per production period
in order to maximize profit.
ABC Furniture Problem
Definition of Variables:
let x be the number of tables to be
produced
y be the number of chairs
z be the profit
ABC Furniture Problem
Goal: Maximize the profit
The problem is to determine the number of
tables and chairs to make per production
period in order to maximize profit.
ABC Furniture Problem
The objective function:
“One table contributes P80 profit, while a
chair contributes P 60.”
Thus the objective function will be:
𝑧 = 80𝑥 + 60𝑦
ABC Furniture Problem
Conditions:
Assembly department is available for 60
hours, in every production period,
finishing department is available 48 hours of
work.
Manufacturing one table requires 4hours in
the assembly line and 2 hours in finishing.
Each chair 2 hours in the assembly line and
4 hours in finishing.
ABC Furniture Problem
Summary table of conditions:
Tables Chairs Time
Available
Assembly 4 hours 2 hours 60 hours
Finishing 2 hours 4 hours 48 hours
Profit P 80 P 60 Maximum
ABC Furniture Problem
Constraints:
Assembly department is available for 60
hours, in every production period
4𝑥 + 2𝑦 ≤ 60
Finishing department is available 48 hours
of work:
2𝑥 + 4𝑦 ≤ 48
ABC Furniture Problem
Non-zero constraints:
𝑥>0
𝑦>0
ABC Furniture Problem
Linear Programming Model:
max 𝑧 = 80𝑥 + 60𝑦
Subject to
4𝑥 + 2𝑦 ≤ 60
2𝑥 + 4𝑦 ≤ 48
𝑥>0
𝑦>0
Graphical Solution
ABC Furniture Problem
The corner points are the following:
(0,0) (0,12) (15,0) and (12,6)
This gives as the optimum solution ( 12,6)
𝑧 = 80 12 + 60 6
= 𝑃 1320
In summary, in finding the optimal solution
of a linear optimization problem you need
to:
1. Formulate an LP model representing
the problem.
a. Define the decision variables
b. Construct the objective function
c. Translate the constraint into linear
inequalities
2. Sketch the graph of the constraints
3. Locate the feasible region
4. Calculate the value of z’s on every
corresponding corner points of the
feasible region
5. The value that gives the
maximum/minimum value for z is the
optimal solution
Try this!
Ozark Farms uses at least 800 lb of special feed
daily. The special feed is a mixture of corn and
soybean meal with the following compositions:
The dietary requirements of the special feed are
at least 30% protein and at most 5% fiber. Ozark
Farms wishes to determine the daily minimum-
cost feed mix.
0.21𝑥1 − 0.30𝑥2 ≤ 0 came from 0.09𝑥1 +
0.60𝑥2 ≥ 0.3 𝑥1 + 𝑥2
0.03𝑥1 − 0.1𝑥2 ≥ 0 came from 0.02𝑥1 +
0.06𝑥2 ≤ 0.05(𝑥1 + 𝑥2 )
Reference
Leaῆo, et al, Quantitative Techniques in
Business c. 2005
Michalewicz Z. How to Solve It: Modern
Heuristics 2nd Ed. Springer c. 2004
Taha, H. Opertations Research 9 ed.
2010
