simplex_method_lecture_1-1

simplex_method_lecture_1-1 - THE SIMPLEX ALGORITHM I Step 1...

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

View Full Document Right Arrow Icon
THE SIMPLEX ALGORITHM I Step 1 Convert LP into standard form. Step 2 Obtain a bfs (if possible) from standard form. Step 3 Determine if the bfs is optimal. Step 4 If non-optimal, determine: a nonbasic variable that should become basic. A basic variable that should become nonbasic. Step 5 Use ero’s to find new bfs with better obj val. Go to step 3. Saigal (U of M) IOE 310 1 / 9
Background image of page 1

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

View Full DocumentRight Arrow Icon
FLOW CHART - SIMPLEX ALGORITHM start with a bfs is it optimum ? stop yes no is there a leaving variable? stop no yes find new bfs unbounded solution optimum solution Saigal (U of M) IOE 310 2 / 9
Background image of page 2
AN EXAMPLE I A furniture manufacturer has the following data: Desk Table Chair Available Lumber in Board ft 8 6 1 48 Finishing Hours 4 2 1.5 20 Carpentry Hours 2 1.5 0.5 8 Selling Price $60 $30 $20 Decision variables x 1 x 2 x 3 number produced Saigal (U of M) IOE 310 3 / 9
Background image of page 3

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

View Full DocumentRight Arrow Icon
II The LP Model: max z = 60 x 1 + 30 x 2 + 20 x 3 8 x 1 + 6 x 2 + x 3 48 4 x 1 + 2 x 2 + 1 . 5 x 3 20 2 x 1 + 1 . 5 x 2 + 0 . 5 x
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 9

simplex_method_lecture_1-1 - THE SIMPLEX ALGORITHM I Step 1...

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

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