Before revision:  Moreover, we show that the dual optimization problem can be posed over a set of countably-additive probability measures, thus eschewing the need for the usual finitely-additive enlargement.
After revision:  Moreover, we show that the dual optimization problem can be posed over a set of countably-additive probability measures, thus eschewing the need for the usual finitely additive enlargement.