In the machine scheduling problem of Section 2.3.7, Job 4 is assigned to Machine B in iteration k = 0. What is the resulting sub problem P(xk) on this machine, and what is its inference dual?
Exhibit a (trivial) solution of the inference dual. What is the Benders cut v ≥ Bk+1(x) for this machine?