Complete the proof of Theorem 4.2 by showing that any finite optimal solution of the relaxation dual of a linear programming problem is an optimal solution of the inference dual with the same optimal value.
Theorem 4.2
The relaxation dual of a linear programming problem has the same optimal value as the inference dual.
In particular, any finite optimal solution of one is an optimal solution of the other.