CMP.5:7 - Conformance Checklist

• The original feasible candidates, objective and useful next decision are stated.
• Every original candidate has the required representation in the relaxed problem, with the inequality in the needed direction.
• The relaxed solver’s returned candidate, optimum, bound or estimate is used at its actual strength.
• Recovery is effective and its feasibility is established under the original conditions when an original candidate is promised.
• Loss through relaxation, incomplete solution and recovery is kept distinguishable where it affects the conclusion.
• Any additive or multiplicative comparison has its required sign and denominator conditions.
• A changed constraint or operation is followed through the relaxation and recovery before their result is reused.