s02rec05

# s02rec05 - Recitation 5 Midterm 1 Review Our thoughts on...

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

Recitation 5 – Midterm 1 Review Our thoughts on topics covered so far (with help from BHM) … This is not intended to be comprehensive… March 8, 2002 First tip: ANSWER THE QUESTION ASKED! Second tip: TRY NOT TO LEAVE ANY QUESTION BLANK. PUT SOMETHING DOWN! Otherwise, we can’t do anything for you… Third tip: Make sure you understand everything on the practice midterm. Formulations A linear program has 3 components: decision variables, objective function, and constraints. One easy way to think about how many decision variables are required that usually (but not always) works is to look at the objective, and see what cost/profit data you have. Then, there should be one decision variable for each cost/profit data point. Don’t forget about non-negativity. Don’t make the problem more complex than it is (although this is hard to do…) 2D Graphing and finding an optimal solution Draw the constraints and determine the feasible region first. Only corner points can be optimal solutions. Then, draw the objective and shift it up or down, depending on if it is a maximization or a minimization problem, to see which corner point is the optimal solution. To determine ranges on objective function coefficients, the slope of the objective function must be between the slopes of the 2 binding constraints. Canonical and Standard Forms

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

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

## This note was uploaded on 12/20/2011 for the course BUS 15.053 taught by Professor Prof.jamesorlin during the Spring '05 term at MIT.

### Page1 / 2

s02rec05 - Recitation 5 Midterm 1 Review Our thoughts on...

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

View Full Document
Ask a homework question - tutors are online