rhodes@espol.edu.

ec

Mathematical programming

 Linear Programming
 Non-linear Programming
 Integer Programming
 Mixed Integer Programming….

Goal is to lose weight.

Objective: Minimize our calories.

Constraints:

 We need a certain number of calories to live

 We need a certain amount of vitamins and nutrients

Decision Variables:

 Amount of cake to eat

 Amount of fruits to eat
 Amount of vegetables to eat ….

Linear Equation: 2𝐴 + 5𝐵 = 10

Non-Linear Equation: 2𝐴2 + 5𝐵3 + 3𝐴𝐵 = 10

Our parameters in the constraints should be in units that are hours/table or hours /chair

𝑚𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑃𝑟𝑜𝑓𝑖𝑡𝑠 = $70𝑇 + $50𝐶

s.t.

𝑐𝑎𝑟𝑝𝑒𝑛𝑡𝑟𝑦 ℎ𝑜𝑢𝑟𝑠: 4𝑇 + 3𝐶 ≤ 240 ℎ𝑜𝑢𝑟𝑠

𝑃 & 𝑉 𝐻𝑜𝑢𝑟𝑠: 2𝑇 + 𝐶 ≤ 100 ℎ𝑜𝑢𝑟𝑠
𝑇, 𝐶 ≥ 0
s.t. means “Subject to” or “Such that”

Let’s us know what comes next are constraints.

1st Constraint:
When Flair Furniture produces no tables (T=0)
4(0) + 3𝐶 = 240
𝐶 = 80
(0, 80)
When Flair Furniture produces no chairs (C=0)
4𝑇 + 3(0) = 240
𝑇 = 60
(60, 0)
2nd Constraint:
When Flair Furniture produces no tables (T=0)

2(0) + 𝐶 = 100
(0, 100)
When Flair Furniture Produces no Chairs (C=0)
2𝑇 + 0 = 100
(50, 0)

Profit = $2,100
𝑂𝑏𝑗𝑒𝑐𝑡𝑖𝑣𝑒 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛: $2,100 = 70𝑇 + 50𝐶 Isoprofit
2100 = 70(0) + 50𝐶
𝐶 = 42 𝑐ℎ𝑎𝑖𝑟𝑠
(0, 42)
2100 = 70𝑇 + 50(0)
𝑇 = 30 𝑡𝑎𝑏𝑙𝑒𝑠
(30, 0)

Obvious Corner Points: (0,0); (50,0); (0,80); (30, 40)

Solve for 4th corner point.

4T + 3C = 240
2T + 1C = 100

We want to eliminate T
Multiply our 2nd equation by -2
-2(2T + 1C = 100) = -4T – 2C = -200

4T + 3C = 240
-4T – 2C = -200
C= 40

Plug C = 40 into a constraint.

2T + 1(40) =100
T= 30

4th Corner Point: (30, 40)

Corner Points: (0,0); (50,0); (0,80); (30, 40)
Plug all of our corner points into the objective function:
(0,0): Profit = $70(0) + $50(0) = $0
(50, 0): Profit = $70(50) + $50(0) = $3,500
(0,80): Profit = $70(0) +$50(80) = $4,000
(30,40): Profit = $70(30) + $50(40) = $4,100
Make 30 Tables and 40 chairs and get a profit of $4,100.
Check for slack with carpentry constraint
If you choose to make 30 Tables and 40 Chairs
Carpentry time used: 4(30) + 3(40) = 240
Slack time in carpentry = 240 – 240 = 0
Binding Constraint.
When we have a binding constraint we might value having one more unit of our resource.

If you choose to make 20 tables and 25 chairs.

Carpentry time used: 4(20)+3(25) = 155
Slack time in carpentry = 240 – 155 = 85
Non-binding Constraint.
When we have a non-binding constraint, we do NOT value having one more unit of the resource.

Holiday Turkey Example

X1 = # of pounds of Brand 1 feed purchased.
X2 = # of pounds of Brand 2 feed purchased.

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

s.t.
5X1 + 10X2 >= 90 ounces
4X1 + 3X2 >= 48 ounces
0.5X1 >= 1.5 ounces
X1, X2 >= 0

Recuperación class is Friday June 7th from 9am – 11am in IB-24.