Constraint¶
Core Idea¶
Limiting possibilities to manage outcomes.
How would you explain it like I'm…
Must-follow rule
When you build a tower with blocks, gravity won't let you stack them sideways in the air. That's a rule you can't break, no matter how clever you are. Some rules just say no, and you have to work around them. The blocks must touch something below.
Hard limit
A constraint is a rule that says certain choices are simply not allowed, no matter how good they might seem. If you have ten dollars and a toy costs fifteen, you can't buy it — your budget is a constraint. Constraints aren't about which option is BEST; they're about which options are even ALLOWED. Once you know your constraints, you can look at all the allowed choices (called the feasible set) and pick the best one from those.
Binding restriction
A constraint is a condition that restricts which configurations or choices are allowed. Anything that violates the constraint is off the table, regardless of how good it might otherwise be. This is different from a preference or an objective: a preference says some options are better, but a constraint says some options aren't options at all. Constraints define the 'feasible set' — the subset of all possibilities that actually satisfy your conditions. Every constraint has a domain (what it applies to), a condition (what must hold), a modal status (hard vs soft, negotiable vs not), and an origin (physical law, budget, regulation, moral commitment). Engineers, economists, and planners all build their thinking around constraints first, then optimize within them.
A constraint is a condition that restricts the admissible configurations, choices, or behaviors of a system to those satisfying it. The defining commitment is that violating the constraint disqualifies a candidate entirely, regardless of merit on other dimensions — making the feasible set (the admissible subset) a first-class object of analysis, separate from the objective that ranks within it. Constraints are distinct from objectives (which order admissible candidates), preferences (which order softly), trade-offs (which arise after constraints define the feasible set), and impossibility proofs (which show the feasible set is empty). Every constraint specifies its domain, the condition that must hold (equality, inequality, logical predicate, conservation law), its modal status (hard/soft, binding/slack), and its origin (physical law, regulation, budget, moral commitment, design envelope). Constraint reasoning is the structural prerequisite for disciplined decision-making under restriction: Lagrange multipliers in mechanics, the simplex method in operations research, KKT conditions in nonlinear optimization, and Goldratt's Theory of Constraints in operations management all instantiate the same structural move.
Broad Use¶
Found in engineering, design, and project management (e.g., budgets, laws of physics).
Clarity¶
Focuses attention on viable solutions by eliminating infeasible options, e.g., time or resource constraints in project management.
Manages Complexity¶
Narrows down possibilities, focusing effort on feasible solutions and eliminating irrelevant options.
Abstract Reasoning¶
Encourages thinking about limitations and trade-offs, fostering innovation within boundaries.
Knowledge Transfer¶
Found in engineering (design tolerances), optimization problems (linear programming), and ethics (moral boundaries).
Example¶
A bridge design must satisfy constraints like maximum weight capacity and material limitations.
Relationships to Other Primes¶
Foundational — no parent edges in the catalog.
Children (31) — more specific cases that build on this
- Access Control is a kind of Constraint — Access control is a specific kind of constraint, restricting admissible principal-action-resource combinations to those satisfying a security policy.
- Circuit Breaker is a kind of Constraint — Circuit breaker is a specific kind of constraint, imposing a binding threshold that interrupts flow once a danger level is exceeded.
- Complexity (Time/Space) is a kind of Constraint — Computational complexity is a specific kind of constraint, binding admissible algorithms to those whose resource growth rate keeps problems practically solvable.
- Containment is a kind of Constraint — Containment is a kind of constraint: a maintained perimeter restricts the admissible reach of an entity, process, or hazard.
- Error Proofing (Poka-Yoke) is a kind of Constraint — Error Proofing is a kind of constraint: the system is designed so that error states are physically inadmissible or immediately detected.
▸ Show 26 more
- Integer Linear Programming (ILP) is a kind of Constraint — Integer linear programming is a specific kind of constraint, binding decision variables to integer values within linear inequalities.
- Interference and Contention is a kind of Constraint — Interference and contention is a specific kind of constraint, where shared-resource competition restricts admissible concurrent throughput.
- Latency is a kind of Constraint — Latency is a specific kind of constraint, binding system response time below an irreducible transit minimum.
- Linear Programming (LP) is a kind of Constraint — Linear programming is a kind of constraint-based formalism in which the feasible region is carved out by linear inequalities.
- Receptor Saturation is a kind of Constraint — Receptor Saturation is a kind of constraint: a finite count of binding sites caps the system's response regardless of further input.
- Requisite Variety is a kind of Constraint — Requisite Variety is a kind of constraint: it imposes a binding lower bound on the regulator's variety relative to disturbance variety.
- Activation Energy presupposes Constraint — Activation energy presupposes constraint because the barrier defines a binding threshold below which the process cannot proceed.
- Checks and Balances presupposes Constraint — Checks and Balances presupposes Constraint: each authority is bound by reciprocal restrictions that exclude unilateral action.
- Cognitive Load presupposes Constraint — Cognitive load presupposes constraint because the working-memory budget is a binding restriction on admissible processing demands.
- Commitment Device presupposes Constraint — A commitment device presupposes constraint because its function is to deliberately restrict the future feasible set of one's later self.
- Decision presupposes Constraint — Decision presupposes constraint because selecting one alternative from a set requires that the admissible set be defined by binding restrictions.
- Degrees of Freedom presupposes Constraint — Degrees of freedom presupposes constraint because counting independent parameters only becomes meaningful once binding restrictions on configurations are specified.
- Design for Implementation presupposes Constraint — Design for implementation presupposes constraint because the discipline is precisely the inclusion of production and operational limits as binding restrictions on design choices.
- Dimensional Analysis presupposes Constraint — Dimensional analysis presupposes constraint because dimensional homogeneity is a binding restriction on which equations among physical quantities can be admissible.
- Minimalism presupposes Constraint — Minimalism presupposes constraint because its disciplined stripping-away operates as a binding restriction on what counts as admissible in the design.
- Reactance presupposes Constraint — Reactance presupposes constraint because the motivational state only arises when a perceived freedom is threatened or restricted by an external limit.
- Structural Violence presupposes Constraint — Structural violence presupposes constraint because the harm it names is produced by social arrangements that systematically restrict admissible life-courses.
- Trade-offs presupposes Constraint — Trade-offs presuppose constraint because the inability to improve all dimensions simultaneously is what makes the feasible set bounded by a frontier.
- Bottleneck is a decomposition of Constraint — A bottleneck is the specific shape a constraint takes when one stage's limited capacity binds the throughput of an entire pipeline.
- Bounded Rationality is a decomposition of Constraint — Bounded rationality is the specific shape constraint takes when the binding restrictions act on cognitive, informational, and time resources of decision-makers.
- Engineering Tolerances is a decomposition of Constraint — Engineering tolerances is the specific shape constraint takes when admissible variation around a nominal target is explicitly bounded for component acceptance.
- Immutability is a decomposition of Constraint — Immutability is the specific shape a constraint takes when in-place modification of a value or record is forbidden across all subsequent operations.
- Mandatory vs. Default Norms is a decomposition of Constraint — Mandatory versus default norms is the specific shape constraint takes when rules are sorted by whether they can or cannot be opted out of.
- Normativity is a decomposition of Constraint — Normativity is the specific shape constraint takes when the binding restriction is an evaluative standard against which states can be judged correct or incorrect.
- Oversight Capacity is a decomposition of Constraint — Oversight capacity is the specific shape a constraint takes on the number of direct sub-units a single supervising entity can effectively manage.
- Scarcity is a decomposition of Constraint — Scarcity is the specific shape constraint takes when the binding restriction is finite supply relative to competing demands on a resource.
Not to Be Confused With¶
- Constraint is not Uncertainty because Uncertainty is incompleteness of knowledge or measurement, while Constraint is a definite restriction on what is possible or permitted.
- Constraint is not Optionality because Optionality is the freedom to choose among possibilities, while Constraint is the reduction of possibility space to a subset of what is logically possible.
- Constraint is not Requisite Variety because Requisite Variety is the principle that a control system must have at least as much variety as the system it controls, while Constraint is a restriction on variable values or action possibilities.
- Constraint is not Dimension because Dimension is a measurable attribute or axis along which variation occurs, while Constraint is a restriction on the values or relationships that attributes can take.
- Constraint is not Scheduling because Scheduling assigns tasks to resources over time respecting some constraints, while Constraint is the restriction itself (precedence, capacity, deadline limits) that scheduling must respect.