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
 MAXIMIZATION MODEL
SLIDESMANIA.COM

Delphi Inc., produce a standard golf bag and deluxe

golf bag on a weekly basis. Each golf bag requires
time for cutting and dyeing and time for serving
and finishing as shown in the table:
STANDARD BAG (x) DELUXE BAG (y) AVAILABLE

A. CUTTING AND DYEING 0.50 1 280

B. SEWING AND FINISHING 1 .70 350

PROFIT PER UNIT 12 14

 MAXIMIZATION MODEL
SLIDESMANIA.COM

STANDARD BAG (x) DELUXE BAG (y) AVAILABLE

A. CUTTING AND DYEING .50 1 280

B. SEWING AND FINISHING 1 .70 350

PROFIT PER UNIT 12 14

Computation:

OBJECTIVE FUNCTION:
✓ Zj = 12x + 14y

CONSTRAINTS:
✓ .50x + 1y 280
✓ 1x + .70 350
✓ x , y = 0 → non - negativity
 MAXIMIZATION MODEL
SLIDESMANIA.COM

→ (560,0) and (0,280)

→ (350,0) and (0,500)

A. .50x + 1y = 280 B. 1x + .70y = 350

Let x = 0 Let x = 0
.50 (0) + 1y = 280 1 (0) + .70y = 350
0 + 1y = 280 0 + .70y = 350
1y = 280 / 1 y = 350 / .70
y = 280 y = 500
Let y = 0 Let y = 0
.50x + 1 (0) = 280 1x + .70 (0) = 350
.50x + 0 = 280 1x + 0 = 350
.50x = 280 / .50 x = 350 / 1
x = 560 x = 350
 MAXIMIZATION MODEL
SLIDESMANIA.COM

(0, 500)

1x + .70 = 350

(280,0)

.50x + 1y = 280

(350,0) (560,0)
 MAXIMIZATION MODEL
SLIDESMANIA.COM

Elimination Method:

1 (.50x + 1y = 280) = .50x + 1y = 280

.50 (1x + .70y = 350) = .50x + .35y = 175
.65y = 105
y = 105 / .65
y = 161.54
.50x + 1y = 280
.50x + 1 (161.54) = 280
.50x = 280 – 161.54
.50x = 118.46
x = 118.46 / .50
x = 236.92

(236.92,161.54)

Feasible Area
 MAXIMIZATION MODEL
SLIDESMANIA.COM

WHAT ARE THE FEASIBLE POINTS:

a. (0 , 280)
b. (236.98 , 161.54)
c. (350 , 0)

Zj = 12x + 14y
a. 12 (0) + 14 (280) = 3,920
b. 12 (236.98) + 14 (161.54) = 5,105
c. 12 (350) + 14 (0) = 4200

WHAT ARE THE OPTIMAL POINTS?

✓ (236.98 , 161.54)

WHAT ARE THE SLACK VARIABLE: AVAILABLE – REQUIRED = SLACK

.50 (236.98) + 1 (161.84) 280 – 280 = 0
1 (236.98) + .70 (161.84) 350 – 350 = 0
 MAXIMIZATION MODEL
SLIDESMANIA.COM