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: 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. Relationship 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).
 Fall '09
 TROTTER

Click to edit the document details