Library / Computational Thinking DPF
Jump to passage
In this reading

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 05:29:54 UTC · snapshot created 2026-10-03 05:30:57 UTC · last check 2026-10-03 06:00:20 UTC

CMP.5:8 - Common Anti-Patterns and How to Avoid Them

Misstep exposed by the methodConsequence and repair
Use a feasible relaxed objective as a minimizing lower boundIt can exceed the original optimum. Obtain an optimum, a dual lower bound or another justified bound.
Return the relaxed point as the original answerFractions or forbidden transitions can make it unusable. Construct and check recovery under the original conditions.
Round without examining the constraintCoverage or capacity can fail. Derive the rounding direction and repair from the constraint’s actual form.
Reuse the old relaxation after adding allowed operationsA former lower bound can become an overestimate, as with diagonal moves. Rebuild the problem comparison.
Tighten a bound after the decision is settledAdditional optimization consumes resources without changing the next action. Stop or redirect effort according to the receiving use.