Construct DR polishing problem from the master problem.
Note
Polishing problem is to minimize the L1-norm of the vector of
all decision rule polynomial terms, subject to the original
master problem constraints, with all first-stage variables
(including epigraph) fixed. Optimality of the polished
DR with respect to the master objective is also enforced.