Question: 2. I just solved an integer program. The figure below shows the nodes including the solution of LP relaxation at each point. I started with
2. I just solved an integer program. The figure below shows the nodes including the solution of LP relaxation at each point. I started with node 1, solved node 2, and so on. The solution of this tree will have an integer objective value. (Do not attempt to recreate the actual problem; you cannot since all the numbers are made up). (1) x'(2,3.5.4.1.3) Z -37.2 32 33 (2) x=(2.6.3.3.3.2) Z32.4 32 X (3) (1.5.2.5.2.3) 2-34.9 (4) X-23.4.1.1.8) (8) X'(2.5,6,1.0) Z"-33.5 (5) Infeasible X (9) (1.8.4.3.1.1) Z.30.7 Z" 31.6 1131) (11) (6) x=(2,3,6,0) Z=30 (7) (10) X-(1.6.2.1) Z-34 Infeasible Infeasible (12) X-(1.5,3,0) Z-29 (13) Infeasible 1. Is this problem a minimization problem or a maximization? Justify your asnwer? 2. One of the LP solutions is incorrect. At what node the LP solution is not correct? Why? 3. What are the optimal solution and the optimal objective value? At which point do we have this solution and at which point do we confirm that this solution is optimal? 4. Some of the nodes have been showed unnecessarily. Which nodes could I fathomed if I were smart? Justify your answer? 2. I just solved an integer program. The figure below shows the nodes including the solution of LP relaxation at each point. I started with node 1, solved node 2, and so on. The solution of this tree will have an integer objective value. (Do not attempt to recreate the actual problem; you cannot since all the numbers are made up). (1) x'(2,3.5.4.1.3) Z -37.2 32 33 (2) x=(2.6.3.3.3.2) Z32.4 32 X (3) (1.5.2.5.2.3) 2-34.9 (4) X-23.4.1.1.8) (8) X'(2.5,6,1.0) Z"-33.5 (5) Infeasible X (9) (1.8.4.3.1.1) Z.30.7 Z" 31.6 1131) (11) (6) x=(2,3,6,0) Z=30 (7) (10) X-(1.6.2.1) Z-34 Infeasible Infeasible (12) X-(1.5,3,0) Z-29 (13) Infeasible 1. Is this problem a minimization problem or a maximization? Justify your asnwer? 2. One of the LP solutions is incorrect. At what node the LP solution is not correct? Why? 3. What are the optimal solution and the optimal objective value? At which point do we have this solution and at which point do we confirm that this solution is optimal? 4. Some of the nodes have been showed unnecessarily. Which nodes could I fathomed if I were smart? Justify your
Study Help