PreLab10 - ENGRI 1101 Engineering Applications of OR Fall...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ENGRI 1101 Engineering Applications of OR Fall ’08 Prelab 10 Integer Programming and the TSP Name: Date: • Thursday section: November 13 • Monday section: November 17 Objectives: • Introduce the students to an integer programming formulation of the traveling salesman problem • Demonstrate the use of the simplex method to solve two linear relaxations of the traveling salesman problem • Give students an appreciation of the difficulty of solving optimization problems exactly • Demonstrate the use of cutting plane methods in solving integer programming problems Key Ideas: • 2-matching problem • fractional 2-matching problem • subtour elimination constraints • cutting planes Reading Assignment: • Handout 8 on Integer Programming and the Traveling Salesman Problem. Brief description: In this lab we explore the idea of solving difficult IPs by solving their LP relaxation....
View Full Document

{[ snackBarMessage ]}

Page1 / 2

PreLab10 - ENGRI 1101 Engineering Applications of OR Fall...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online