Constraint Relaxation

Constraint relaxation is a problem-solving move: temporarily drop or loosen a constraint to make a hard problem tractable, then reintroduce the constraint and adapt the solution. In algorithms, the relaxed problem (e.g. allowing fractional solutions where integers are required) often yields structure — bounds, dual values, or a feasible rounding — that guides the full solution. In strategy and product, the same move breaks logjams: "What if we didn't need to be in every market?" "What if we could ship in six months instead of two years?" The relaxed problem is easier to solve; the answer often reveals what the binding constraint really was.

The power is in the ordering. Solve the relaxed problem first. Get a solution, or a proof that even the relaxed problem is impossible. Then tighten. If the relaxed solution happens to satisfy the original constraints, you're done. If not, you've learned which constraints bite and where to focus — redesign, negotiate, or accept a worse objective. The mistake is to treat all constraints as equally sacred from the start. Many "impossible" problems become possible when one constraint is relaxed; many "necessary" constraints turn out to be habits.

In practice, constraint relaxation shows up in resource allocation (relax the budget, see what you'd do), in design (drop "must work offline" and see what the product becomes), and in negotiation (what if the other side got X?). The discipline is to make relaxation explicit: name the constraint you're dropping, solve the simpler problem, then decide whether to reimpose the constraint or to change the real-world situation so the relaxed solution becomes feasible.