Answer Happy

solve the following problem by Branch and bound algorithm for convenience always select x1 as the branching variable when x1 and x2 are fractional. use the pom for windows output below show all the details on the diagram to get full creditmaximize z=x1 + x2 st .2x1 + 5x2≤166x1 + 5x2≤30x1,x2≥0 and integer
19. Solve the following problem by the branch and bound algorithm. For convenience, always select x₁ as the branching variable when x₁ and x2 are fractional. Use the POM for Windows output below. Show ALL the details on the diagram to get full credit (10 Points) Maximise z = x1 + x₂ St. 2x1 + 5x2 ≤ 16 6x1 + 5x2 ≤30 x₁, x220 and integer. Added constraint XI<=3 XI>=4 X2<= 1 XI<=4 XI>=5 X2=2 Solution type Optimal NONinteger INTEGER Solution Value 5 5.3 NONinteger 5.2 NONinteger 5.17 INTEGER INTEGER Infeasible 95 X1 3 3.5 3 4 4.17 4 5 X2 2 1.8 2 1.2 1 0 Student N gramme of Study. SBE GRZ 'D Level: Ref 0 5291 Be Tuiti Being Tuition F losing Bar