DMOR-05-06 -...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: UF-ESI-63143a360f4b5747f496085a91e86bb1e0ade081dc59.xls Problem Statementpage 1 of 4Luther Setzer1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899(321) 544-7435Maximizesubject to05-06.Solve the following problem by branch-and-bound. Solve the linear programming problems at each node of your branch-and-bound tree graphically (and please show your work).5x1+ 2x2x1+ x283x1+ 2x216x 0 and integerUF-ESI-63143a360f4b5747f496085a91e86bb1e0ade081dc59.xls Relaxed Solutionpage 2 of 4Luther Setzer1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899(321) 544-7435Begin by graphing the given linear program and solving in a relaxed fashion.==>==>Series 1 Series 20 8 8 16 16 1 7 6 1/2 19 18 2 6 5 22 20 3 5 3 1/2 25 22 4 4 2 28 24 5 3 1/2 31 26 5 1/3 2 2/30 32 26 2/36 2 -1 34 28 7 1 -2 1/2 37 30 8 0 -4 40 32 Solving graphically shows Series 1 as outside the feasible region and yields:=5 1/3=0 z=26 2/3z= 5x1+ 2x2x1+ x28x28 - x13x1+ 2x216x28 - 3/2(x1)x 0x1x2x2z1z2x1x20 1 2 3 4 5 6 7 8 9 -6 -4 -2 0 2 4 6 8 10 Column BColumn Cx1x2UF-ESI-6314...
View Full Document

Page1 / 4

DMOR-05-06 -...

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

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