11. Dakin's algorithm (33%) Use the Dakin's algorithm presented in class to solve the following p...
Will rate. Must show all work (30 points. Use the MIP branch-and-bound algorithm to solve the following problem interactively. Use the graphical method to solver for each LP relaxation problem. Minimize Z = -x - y subject to 5x + 2y = 60 3x + 4y = 45 and X1 2 0,x2 > 0 integers. Show the graph for each LP relaxation problem.
USE THE BRANCH AND BOUND (B&B) ALGORITHM!!!! Please show all the steps, including the branching and the graphs. 362 Chapter 9 nteger Linear Programming 9-56. Develop the B&B tree for each of the following problems. For coaseni xi as the branching variable at node 0. (a) Maximizez 3xi + 2r2 subject to x, x2 2 0 and integer (b) Maximizez2r, + 3x2 subject to 5x 7x2 s 35 x1, x2 0 and integer (c) Maximizezx + x2 subject to 2x1...
8. EXTRA CREDIT (15 points] Solve the ILP problem below using the branch-and- bound method with LP relaxation, as illustrated on Slides 27-31 of the "ILP: Part II” lecture notes. Show your resulting search tree. You can use MATLAB to solve LP- relaxed subproblems as needed, or you can solve them graphically by hand. maximize subject to 17X1 10x1 + + + 12x2 7x2 X 1 X2 VI VAL 40 5 0 integers. X1, X2 X1, X2 10/3. Branch Hint:...
Use graphical methods to solve the following linear programming problem. Maximize: z= 3x + y subject to: x-ys7 3x + 5y = 45 X20, y20 Graph the feasible region using the graphing tool to the right. Click to enlarge graph , at the corner point The maximum value of z is (Simplify your answers.) of T o to 12 14 16
Excel Use Simplex method and Exel To solve the following LPPs. Maximize Maximize P-3x + x2 subject to the constraints x1 + x2 = 2 2x) + 3x2 s 12 3x + = 12 x 20 x220 P = 5x1 + 7x2 subject to the constraints 2xy + 3x2 = 12 3x + x2 = 12 x 20 *2 2 0 Maximize Maximize P = 2x2 + 4x2 + x3 subject to the constraints -*1 + 2x2 + 3x3 5...