Question: Problem #2 Consider the following tableau obtained after simplex iteration for a maximization problem: 0 20 00 33.9023 0 14 0724.8 0.6 0 0 0.3

 Problem #2 Consider the following tableau obtained after simplex iteration for

Problem #2 Consider the following tableau obtained after simplex iteration for a maximization problem: 0 20 00 33.9023 0 14 0724.8 0.6 0 0 0.3 0 1 0 4.2 0 12.9 0 0.4 00 0.2 0 9 3.8 0 0 0 1. 0 .4 03 0 -4.9 00 14.2 0 4.3 0 7.7 0 2.4 0 2.2 08.7 0 0.9 00 7.7 01.6 0 2 012.6 0 3.5 00 3.90 7 00.3 (a) Identify al the basic and non-basic variables. (b) Identify the current solution (c) Generate as many Gormory's cuts as possible. (d) Pick any of the above Gormory's cut, and show it is valid. Now consider the following BnB enumeration tree: P 950 6 940 #2 8 920 P925 IFS Answer the following based on the above tree, using the strategies discussed in the class: (e) Is it a maximization or a minimization problem? Explain. (f) What could be the node selection strategy in the above tree? Explain (g) What could be the branching direction selection strategy in the above tree? Explain. (h) At (P2), the LP solution773,. What could be the variable selection strategy? Explai to investigate. Explain. the following constraints: (i) Assume that Problem (P) was just solved, and we got an IFS. Now, identify the next node (i) Write the constraint of the LP formulation of Ps. Assume the original integer formulation has 12r 52 25rs +7a4 130 Problem #2 Consider the following tableau obtained after simplex iteration for a maximization problem: 0 20 00 33.9023 0 14 0724.8 0.6 0 0 0.3 0 1 0 4.2 0 12.9 0 0.4 00 0.2 0 9 3.8 0 0 0 1. 0 .4 03 0 -4.9 00 14.2 0 4.3 0 7.7 0 2.4 0 2.2 08.7 0 0.9 00 7.7 01.6 0 2 012.6 0 3.5 00 3.90 7 00.3 (a) Identify al the basic and non-basic variables. (b) Identify the current solution (c) Generate as many Gormory's cuts as possible. (d) Pick any of the above Gormory's cut, and show it is valid. Now consider the following BnB enumeration tree: P 950 6 940 #2 8 920 P925 IFS Answer the following based on the above tree, using the strategies discussed in the class: (e) Is it a maximization or a minimization problem? Explain. (f) What could be the node selection strategy in the above tree? Explain (g) What could be the branching direction selection strategy in the above tree? Explain. (h) At (P2), the LP solution773,. What could be the variable selection strategy? Explai to investigate. Explain. the following constraints: (i) Assume that Problem (P) was just solved, and we got an IFS. Now, identify the next node (i) Write the constraint of the LP formulation of Ps. Assume the original integer formulation has 12r 52 25rs +7a4 130

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!