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 10:39:28 UTC · snapshot created 2026-10-03 10:40:04 UTC · last check 2026-10-03 11:25:15 UTC

CMP.5:3 - Forces

ForceWhat must be reconciled
Easy and informative relaxationRemoving many restrictions may simplify solution but leave a weak bound or hard recovery.
Relaxed value and admissible candidateThe easier optimum can be unobtainable under the original conditions.
Solver effort and useful improvementTightening a bound can cost more than exploring or using the current candidate.
Recovery and lost qualityRounding or repair can restore feasibility while worsening the objective.
Mathematical and computed boundsApproximate optimization and arithmetic can weaken or invalidate a claimed bound direction.
One criterion and several interestsA scalar optimization result answers its stated criterion; other objectives retain their own comparison.