Consider the general LP problem min{cx | Ax ≥ b}, and let Ai x ≥ bi be constraint i of Ax ≥ b. Define an inference dual as in the previous , and suppose that summing the constraints Ai ≥ bi for i ∈ I...

Consider the general LP problem min{cx | Ax ≥ b}, and let Ai

x ≥ bi be

constraint i of Ax ≥ b. Define an inference dual as in the previous ,

and suppose that summing the constraints Ai ≥ bi for i ∈ I is a proof

that solves the dual. Based on this solution, state a value-bounding function

v(b + Δb). What is this function for each of the two dual solutions identified

in the previous ?