previously in chapter 6

17
Previously in Chapter 6 • Using binary variables • Unintended options • Lack of sensitivity analysis

Upload: maegan

Post on 05-Jan-2016

21 views

Category:

Documents


7 download

DESCRIPTION

Previously in Chapter 6. Using binary variables Unintended options Lack of sensitivity analysis. Agenda. Quiz logistics Finish binary variables Traveling salesman problem Nonlinear functions Finishes optimization (Will come back to chapter 5 later.). Quiz Survey. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Previously in Chapter 6

Previously in Chapter 6

• Using binary variables• Unintended options• Lack of sensitivity analysis

Page 2: Previously in Chapter 6

Agenda

• Quiz logistics

• Finish binary variables– Traveling salesman problem

• Nonlinear functions– Finishes optimization– (Will come back to chapter 5 later.)

Page 3: Previously in Chapter 6

Quiz Survey

Should I move it? 11 Yes, 3 No

Most preferred Acceptable

Mon-Tue 4 6

Tue-Wed 4 9

Wed-Thur 3 9

Thur-Fri 3 9

Fri-Sat 1 6

Page 4: Previously in Chapter 6

Quiz

• Tue 11am to Wed 11am

• office hours Mon 4-5

• moving Wed office hours to Tue 4-5

Page 5: Previously in Chapter 6

Agenda

• Quiz logistics

• Finish binary variables– Traveling salesman problem

• Nonlinear functions– Finishes optimization– (Will come back to chapter 5 later.)

Page 6: Previously in Chapter 6

Traveling Salesman Problem

Chicago

Detroit

Atlanta

Page 7: Previously in Chapter 6

Traveling Salesman Problem

• Data: Cities and Distances

• Goal: minimize travel time to tour all cities(visit each city exactly once)

Page 8: Previously in Chapter 6

Traveling Salesman Problem (TSP)

• Famous problem

• Vehicle Routing

• Job Sequencing (p207)– 5 tasks that need to be done on a machine– Setup time for a task depends on the task

that just completed

Page 9: Previously in Chapter 6

Job Sequencing

task 1 task 2

task 3

task 4task 5

start/finish

Page 10: Previously in Chapter 6

Solving TSP

1. Setup an assignment problem

Page 11: Previously in Chapter 6

Solving TSP

1. Setup an assignment problem

2. Any subtours (loops of length k<n) ?

Page 12: Previously in Chapter 6

Solving TSP

1. Setup an assignment problem

2. Any subtours (loops of length k<n) ?

3. Add subtour constraints• sum of variables ≤ k-1• now binary variables needed

Page 13: Previously in Chapter 6

Solving TSP

1. Setup an assignment problem2. Any subtours (loops of length k<n) ?3. Add subtour constraints

• sum of variables ≤ k-1• now binary variables needed

4. Repeat (go to stop 2)• often you finish quickly

(though no guarantees)

Page 14: Previously in Chapter 6

Nonlinear functions

• product terms– chemical processes– area, volume– variance

• log terms– utility functions– entropy

Page 15: Previously in Chapter 6

Nonlinear Functions

• Sensitivity Analysis– Like a derivative

• Sqrt() function– Help the solver by defining it for x<0

• Solution may depend on starting point– Solvers use hill-climbing methods

Page 16: Previously in Chapter 6

Nonlinear Example

• Given a set of rectangular boxes, how many can you fit into a container?

Page 17: Previously in Chapter 6