DMOR-05-06

# DMOR-05-06 - UF-ESI-6314DMOR-05-06.xls Problem...

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

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

View Full Document

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.

Unformatted text preview: UF-ESI-6314DMOR-05-06.xls Problem Statementpage 1 of 4Maximize5x1+ 2x2subject tox1+ x2≤83x1+ 2x2≤16x≥0 and integer05-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).Luther Setzer1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899(321) 544-7435UF-ESI-6314DMOR-05-06.xls Relaxed Solutionpage 2 of 4Begin by graphing the given linear program and solving in a relaxed fashion.z= 5x1+ 2x2x1+ x2≤8==>x2≤8 - x13x1+ 2x2≤16==>x2≤8 - 3/2(x1)x≥Series 1 Series 2x1x2x2z1z2881616176 1/2 19182652220353 1/2 25224422824531/2 31265 1/3 2 2/33226 2/362-1342871-2 1/2 37308-44032Solving graphically shows Series 1 as outside the feasible region and yields:x1=5 1/3x2=z= 26 2/3-6-4-2246810123456789x1x2Series1Series2Luther Setzer1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899(321) 544-7435UF-ESI-6314DMOR-05-06.xls Node 1page 3 of 4Focus on Series 2 and begin the branch and bound analysis by restricting to integer variables.Focus on Series 2 and begin the branch and bound analysis by restricting to integer variables....
View Full Document

## This note was uploaded on 02/25/2010 for the course ESI 6314 taught by Professor Vladimirlboginski during the Fall '09 term at University of Florida.

### Page1 / 4

DMOR-05-06 - UF-ESI-6314DMOR-05-06.xls Problem...

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

View Full Document
Ask a homework question - tutors are online