27
Previously in Chapter 4 • Assignment Problems • Network Flow Problems • Vehicle Routing Problems • Transportation Problems • Staffing Problems

Previously in Chapter 4

  • Upload
    maalik

  • View
    37

  • Download
    0

Embed Size (px)

DESCRIPTION

Previously in Chapter 4. Assignment Problems Network Flow Problems Vehicle Routing Problems Transportation Problems Staffing Problems. Agenda. Sensitivity Analysis Optimization tricks: If statements Diseconomy of Scale Projects Sequential Decision Processes a.k.a. Production Planning. - PowerPoint PPT Presentation

Citation preview

Page 1: Previously in Chapter 4

Previously in Chapter 4

• Assignment Problems• Network Flow Problems

• Vehicle Routing Problems• Transportation Problems• Staffing Problems

Page 2: Previously in Chapter 4

Agenda

• Sensitivity Analysis• Optimization tricks: If statements• Diseconomy of Scale• Projects

• Sequential Decision Processes– a.k.a. Production Planning

Page 3: Previously in Chapter 4

Sensitivity AnalysisIf you are missing these columns

Page 4: Previously in Chapter 4

Sensitivity Analysis

Page 5: Previously in Chapter 4

Sensitivity Analysis

make sure it is checked

Page 6: Previously in Chapter 4

If statements (Part 1)

• Not in typical optimization formulation• Harder for solvers

min f(x1,x2,…,xn)s.t. g1(x1,x2,…,xn) ≤ b1

g2(x1,x2,…,xn) = b2

…x1 ≤0, x3 binary, x4≥0, x4 integer, …

(note that there is sign-constraint on x2,sometimes we say “x2 is a free variable”)

Page 7: Previously in Chapter 4

If statements (Part 2)0 ≤x andIf x≤b, then y=c, else y=d

• create binary 0/1 variable z• add the constraints

(b-x)/b ≤ z (if x≤b, then z=1)z≤1+(b-x)/b (if x>b, then z=0)y=cz+d(1-z) (if z=1, then y=c else y=d)

Page 8: Previously in Chapter 4

If statements (Part 3)

• Binary variables are hard for solvers– though better than if statements

• Sometimes can be avoided– for example: diseconomies of scale

(certain piecewise linear functions)

Page 9: Previously in Chapter 4

Diseconomy of Scale

quantity

revenueor profit

quantity

cost

mathematically equivalent

Page 10: Previously in Chapter 4

Economy of Scale

revenueor profit

quantity

quantity

cost

mathematically equivalent

Page 11: Previously in Chapter 4

Projects

• 10% of final grade(worth a couple of homeworks)

• Groups of up to 3• Topic areas:

– optimization (should start around now)– stochastic models (later)

Page 12: Previously in Chapter 4

Optimization Projects

• airline scheduling• asset allocation• production planning• class scheduling• tournament setup• design optimization• comparing algorithms

I will post more details online

Page 13: Previously in Chapter 4

Examples

• Airline scheduling– Virgin America network– 2 flight/day per link– How many planes are needed?

• Asset Allocation– July ‘08 Northwestern endowment at $8b– How would you have invested it?

Page 14: Previously in Chapter 4

Todo

Group should meet me• discuss project• negotiate deliverables• and deadlines

– earlier for optimization topics

Page 15: Previously in Chapter 4

Sequential Decision Process

• Discretize Time

• Variables for each period– for example: #workers Wk, inventory level Ik

period k=1 2 3 4 5 …

Page 16: Previously in Chapter 4

Production Planning (4.12)

1. List time periods– maybe add an extra at beginning and end

2. List variables (things to keep track of)– states and actions

3. Make timeline for a single period4. Add constraints

– “laws of motion”: constraints connecting a period to the next

5. Add objective6. Solve

Page 17: Previously in Chapter 4

Problem Summary

• Producing snow tires• Monthly demand: Oct-March• Goal: cheaply meet demand• Decisions:

– hire or fire, overtime, production quantity• Inventory cost, trainees are less

productive

Page 18: Previously in Chapter 4

Production Planning (4.12)

1. List time periods– maybe add an extra at beginning and end

2. List variables (things to keep track of)– states and actions

3. Make timeline for a single period4. Add constraints

– “laws of motion”: constraints connecting a period to the next

5. Add objective6. Solve

Page 19: Previously in Chapter 4

Production Planning (4.12)

1. List time periods– maybe add an extra at beginning and end

2. List variables (things to keep track of)– states and actions

3. Make timeline for a single period4. Add constraints

– “laws of motion”: constraints connecting a period to the next

5. Add objective6. Solve

Page 20: Previously in Chapter 4

Variables

For each period• # hired Hk, #fired Fk

• #trained and trainee workers– total #workers Wk, #trained workers Tk

• units produced• overtime used

– Rk units produced with regular hours,– Ok units produced with overtime

• inventory Ik

Page 21: Previously in Chapter 4

Production Planning (4.12)

1. List time periods– maybe add an extra at beginning and end

2. List variables (things to keep track of)– states and actions

3. Make timeline for a single period4. Add constraints

– “laws of motion”: constraints connecting a period to the next

5. Add objective6. Solve

Page 22: Previously in Chapter 4

Timeline

Period k

Wk #workers

Hk #hiredFk #fired

Production DecisionRk #units with regular timeOk #units with overtime

Tk #trained workers

Ik #units inventory

Dk #units shipped

next periodprev. period

Page 23: Previously in Chapter 4

Production Planning (4.12)

1. List time periods– maybe add an extra at beginning and end

2. List variables (things to keep track of)– states and actions

3. Make timeline for a single period4. Add constraints

– “laws of motion”: constraints connecting a period to the next

5. Add objective6. Solve

Page 24: Previously in Chapter 4

Constraints• Inventory:

I1=0, Ik+1=Ik+Rk+Ok-Dk

• Meeting Demand:Ik+1 ≥ 0

• WorkforceW1=90, Wk+1=Wk+Hk-Fk

Tk=Wk-Fk, T7=100• Capacity

Rk≤18Tk+8Hk

Ok ≤(18/4)Tk

• Nonnegativity

Page 25: Previously in Chapter 4

Production Planning (4.12)

1. List time periods– maybe add an extra at beginning and end

2. List variables (things to keep track of)– states and actions

3. Make timeline for a single period4. Add constraints

– “laws of motion”: constraints connecting a period to the next

5. Add objective6. Solve

Page 26: Previously in Chapter 4

Objective

• Hiring / Firing costs$3000*(H1+…+H7)$7000*(F1+…+F7)

• Compensation$2600*(W2+…+W7)$2600*1.5*(O1+…+O7)/18

• Inventory$40*(I1+…+I7)

Page 27: Previously in Chapter 4

Variations and Extensions

• Transportation Problem with delays• Multiple products• Multiple production steps• Warehouses• Everything combined