This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: ENGRI 1101 Engineering Applications of OR Fall 08 Handout 7.5 Study Guide for Prelim 1 1. (a) What is a linear program? (b) Describe the canonical forms (maximization and minimization). (c) What is an integer program? (d) What is the LP relaxation of an integer program? How is this related to the integer program? (e) Describe the simplex algorithm. (What do you need to start the algorithm?) (f) Describe the branch-and-bound technique. What kind of a bound does a feasible integer solution provides? What kind of a bound does a solution for the LP relaxation provides? When do you fathom a node? How do you branch? If you have a good(!) solution obtained by a heuristic, how would this affect the number of LPs you need to solve (or nodes of the B-and-B tree you need to investigate)? 2. Review problems 1-7, 12, 17, 38 (dont solve, just formulate!), 45 from page 112, Winston, Chapter 3, included in the course pack. (It is enough to solve few of them carefully and take a look at the rest!)included in the course pack....
View Full Document