Prelim2reviewsheet - 3. Running the Hungarian Algorithm to...

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

View Full Document Right Arrow Icon
ENGRI 1101: Prelim 2 Review Sheet April 19, 2011 The Prelim is on THURSDAY, April 21 from 7:30-9:00 PM in Phillips 219. Class is open for questions on April 21. Special office hours: Office hours will be from 5:30 to 6:30 on Tuesday and Wednesday in Rhodes 412 as usual. If you cannot make these hours please email me to set up additional office hours. You may bring one 3 × 5 note card to the exam which you will turn in with your exam. The Prelim will cover lectures from 2/24 through 4/12 (not including guest-lecture material from 3/8-3/10), and the corresponding assigned readings. Prelim 2 will not cover material from the first 5 weeks of the course. Transportation Problem 1. Problem definition: form of the input, requirements for a feasible solution, objective. 2. How to balance a transportation problem. Assignment Problem 1. Problem definition: inputs, feasible solution, objective. 2. Ideas about adjusting the costs of rows/columns.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3. Running the Hungarian Algorithm to solve the assignment problem. Linear Programming 1. Components of an LP: decision variables, constraints, objective. 2. Formulating other problems as LPs. 3. Applying the graphical method to solve an LP: graphing the feasible region, nding the extreme point which is optimal, etc. 4. Running the SIMPLEX algorithm to solve an LP (be able to run it) 5. Simplex vocabulary: entering variable, leaving variable, etc. 1 Integer Programming 1. Components of an IP: decision variables, constraints, objective. 2. Formulating other problems as IPs. 3. Ideas about relaxations (relaxing integrality constraints, relaxing other constraints): change in the optimal solution that results. Relation-ship of the IP to its LP relaxation. 4. using the graphical method to solve an IP. 2...
View Full Document

This note was uploaded on 09/07/2011 for the course OR 1101 taught by Professor Trotter during the Fall '09 term at Cornell University (Engineering School).

Page1 / 2

Prelim2reviewsheet - 3. Running the Hungarian Algorithm to...

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