Solve it step by step using your hand

Consider the following final tableau obtained after simplex iteration for a maximization problem. Assume the problem satisfies the conditions needed to develop Gomory's fractional cut. Assume that the objective function coefficients in the original problem were integer. (a) Identify all the basic and non-basic variables. Identify the current solution. (b) Generate as many Gomory's cuts as possible. (c) Pick any of the above Gomory's cut, and show it is valid. Consider the following BnB enumeration tree: Answer the following based on the above tree, using the strategies discussed in the class. Note: IFS stands for Integer Feasible Solution. (d) Is it a maximization or a minimization problem? Explain. (e) Write all the possible pairwise relations among A, B, C, D. Also suggest a possible upper or lower value for A,B,C,D. (f) What could be the node selection strategy in the above tree? Explain your answer using: best bound, depth first best back, breadth first best next, most recent. (g) What could be the branching direction selection strategy in the above tree? Explain your answer using: branch-up, branch-down, mixed. (h) At (P3), the LP solution is x1(3)=5,x2(3)=3.1,x3(3)=7,x4(3)=5.9. What could be the variable selection strategy? Explain your answer using: highest fraction, lowest fraction, or nearest to integer. (i) Write the relationship between E&F. Also suggest a possible upper or lower value for E&F. (j) Explain a possible sequence of events that occurred from node (P7) to node (P9). Based on the explanation, what should be the next node to process? (k) What is the incumbent solution in the above tree? How far is it from the global optimal solution