SLIDESMANIA.

COM

Linear Programming
SLIDESMANIA.COM

Linear Programming
➢ is a mathematical technique which permits the

determination of the best use of available

resources

● We will talk about this second.

● We will talk about this last.

SLIDESMANIA.COM

Linear Programming
• MAXIMIZATION MODEL – starts with an objective
function with the purpose of maximizing a goal
which can be in the form of:
✓ Profits
✓ Sales
✓ Target Audience
✓ Number of Customers
✓ Or any variable wherein more is desired
SLIDESMANIA.COM

Linear Programming
• MINIMIZATION MODEL – starts with an objective
function with the purpose of minimizing a goal
which can be in the form of:
✓ Expenses
✓ Cost
✓ Target Time
✓ Distance
✓ Energy
✓ Or any variable wherein less is desired
SLIDESMANIA.COM

Linear Programming
• MINIMIZATION MODEL – starts with an objective
function with the purpose of minimizing a goal
which can be in the form of:
✓ Expenses
✓ Cost
✓ Target Time
✓ Distance
✓ Energy
✓ Or any variable wherein less is desired
 Problem!
Sample
SLIDESMANIA.COM
 MINIMIZATION MODEL
SLIDESMANIA.COM

Jacob is the purchasing manager of Kraft Foods,

and he wants to determine the supply mix that will
result on minimum cost. He was able to determine
the necessary data to make decision.
PRODUCT / SUPPLIER ALASK NESTLE CASES / DAY

CHEESE 5 11 110

BUTTER 7 8 112

CREAM 9 4 72

COST PER GALLON 50 55

 MINIMIZATION MODEL
SLIDESMANIA.COM

Computation:

OBJECTIVE FUNCTION:
✓ Zj = 50x + 50y

CONSTRAINTS:
✓ 5x + 11y 110
✓ 7x + 8y 112
✓ 9x + 4y 72
 MINIMIZATION MODEL
SLIDESMANIA.COM

→ (22,0) and (0,10)

→ (16,0) and (0,14)
→ (8,0) and (0,18)

CHEESE : 5x + 11y = 110 BUTTER: 7x + 8y = 112 CREAM: 9x + 4y = 72

Let x = 0 Let x = 0 Let x = 0

5 (0) + 11y = 110 7 (0) + 8y = 112 9 (0) + 4y = 72
0 + 11y = 110 0 + 8y = 112 0 + 4y = 72
y = 110 / 11 y = 112 / 8 y = 72 / 4
y = 10 y = 14 y = 18
Let y = 0 Let y = 0 Let y = 0
5x + 11 (0) = 110 7x + 8 (0) = 112 9x + 8 (0) = 72
5x + 0 = 110 7x + 0 = 112 9x + 0 = 72
5X = 110 / 5 x = 112 / 7 x = 72 / 9
x = 22 x = 16 x=8
 MINIMIZATION MODEL
SLIDESMANIA.COM

y
24
22
20
(0,18)18

16
(0,14)14

12
(0,10)10
8

2
0 2 4 6 8 10 12 14 16 18 20 22 24 x
(8,0) (16,0) (22,0)
 MINIMIZATION MODEL
SLIDESMANIA.COM

Elimination Method:
5x + 11y = 110
7 (5x + 11y = 110) = 35x + 77y = 770
5x + 11 (5.68) = 110
5 (7x + 8y = 112) = 35x + 40y = 560
5x + 62.48 = 110
37y = 210 5x = 110 -62.48
y = 210 / 37 5x = 47.52
y = 5.68 x = 47.52 / 5
x = 9.50

9 (7x + 8y = 112) = 63x + 72y = 1008 7x + 8y = 112 Feasible Area

7 (9x + 4y = 72) = 63x + 28y = 560 7x + 8 (11.45) = 112
44y = 504 7x + 91.6 = 112
y = 504 / 44 7x = 110 -91.6
y = 11.45 7x = 20.4 (2.91 ,11.45)
x = 20.4 / 7
x = 2.91

(9.50 , 5.68)
 MINIMIZATION MODEL
SLIDESMANIA.COM

WHAT ARE THE FEASIBLE POINTS:

a. (22,0)
b. (9.50,5.68)
c. (2.91, 11.45)
d. (0,18)
Zj = 50x + 55y
a. 50 (22) + 55 (0) = 1,100
b. 50 (9.50) + 55 (5.68) = 787.40
c. 50 (2.91) + 55 (11.45) = 775.25
d. 50 (0) + 55 (18) = 990
WHAT ARE THE OPTIMAL POINTS?
✓ (2.91, 11.45)
WHAT ARE THE SLACK VARIABLE: AVAILABLE – REQUIRED = SLACK
CHEESE: 5 (2.91) + 11 (11.45) = 140.5 or 141 141 – 110 = 31
BUTTER: 7 (2.91) + 8 (11.45) = 111.97 or 112 112 – 112 = 0
CREAM: 9 (2.91) + 4 (11.45) = 71.99 or 72 72 – 72 = 0