Given the following mixed integer LP: min u.d.N. Solve the MILP using the branch-and-bound method. Illustrate...

  

Transcribed Image Text:

Given the following mixed integer LP: min u.d.N. Solve the MILP using the branch-and-bound method. Illustrate the evo- lution of the solutions via tree structure. 2x1 - 5x2 -8r1 +7x₂ ≤ 20 11+1₂ ≤8 11, 12 20 11,1₂ €Z Task 2 Write a commented MATLAB program that solves an MILP in general form using the branch-and-bound method. Use linprog to solve the relaxed LP. In addition, your program should satisfy the following specificati- ons: • After each iteration: - Output the number of all nodes to be examined. output the current vector a output the current value ca After convergence: - Output of the required iterations. Output of the optimal vector a - Output the optimal value ca. Solve with your program: • The MILP from task 1 Given the following mixed integer LP: min u.d.N. Solve the MILP using the branch-and-bound method. Illustrate the evo- lution of the solutions via tree structure. 2x1 - 5x2 -8r1 +7x₂ ≤ 20 11+1₂ ≤8 11, 12 20 11,1₂ €Z Task 2 Write a commented MATLAB program that solves an MILP in general form using the branch-and-bound method. Use linprog to solve the relaxed LP. In addition, your program should satisfy the following specificati- ons: • After each iteration: - Output the number of all nodes to be examined. output the current vector a output the current value ca After convergence: - Output of the required iterations. Output of the optimal vector a - Output the optimal value ca. Solve with your program: • The MILP from task 1

Answer rating: 100% (QA)

The question appears to be from an assignment or exam asking for two things 1 Solve a given mixedint... View the full answer