Discrete Commitment Optimization

Choose among indivisible options or commitments when partial allocation is impossible.

Version

v1 · 2026-08-24 · History

Solution archetype #

342

Problem family

Decision, Search & Optimization Failure

Problem subfamily

Allocation, Matching & Opportunity Cost

Essence

Discrete Commitment Optimization is the intervention pattern for decisions where the real action is not a smooth allocation but a set of whole commitments. A city does not build 37 percent of a clinic in one neighborhood and 63 percent in another; a team does not assign half a person to a shift if the shift requires a qualified worker; a procurement board cannot buy a fractional vendor contract. The archetype makes those all-or-nothing or whole-number commitments explicit, then selects a feasible bundle under objectives and constraints.

The key move is to stop evaluating each option as if it stood alone. The best feasible bundle may exclude a high-scoring individual option because it blocks a needed dependency, consumes too much shared capacity, violates a coverage rule, or creates an unfair assignment pattern. The archetype therefore treats the combination as the decision object.

Compression statement

When decisions are discrete rather than continuous, optimize the combination of yes/no, integer, assignment, siting, or bundle choices under explicit objectives and constraints instead of pretending that fractional allocation or simple ranking is implementable.

Canonical formula: Given indivisible options I, discrete decision variables x, objective O, coupling constraints C, and feasible combinations F, choose a commitment bundle x* in F that best advances O while preserving hard constraints and implementation legitimacy.

When This Archetype Applies

Partial catalog groundingSome structural conditions are represented by existing abstractions, but no sufficient condition set is fully represented.

Diagnostic problem

A decision contains indivisible or integer commitments coupled by constraints, but it is treated as smoothly divisible, fractionally allocable, or separable one option at a time.

What this problem means

The structural problem is false continuity. Decision-makers may reason as if options can be partially funded, smoothly adjusted, or independently ranked, while the real world demands whole commitments. A fractional or locally attractive answer then fails at implementation: projects cannot be half-launched, coverage requirements are missed, dependencies are broken, or a rounded answer violates capacity.

A second structural problem is bundle interaction. Each option may look good alone, but the selected set can be poor because choices share budgets, staff, space, deadlines, political legitimacy, or technical dependencies. Discrete commitment problems therefore require combination-level feasibility, not just option-level scoring.

Applicability expression5 distinct conditions

Indivisible optionsandConstraint-coupled choicesandInteger commitment requirementandBinding allocation constraintsandContinuous treatment mismatch

Algebraic1∧2∧3∧4∧5

2=a∨b∨c

4=a∨b∨c∨d∨e∨f∨g∨h∨i

′ context guard? connective not recorded∅ no catalog witness yet

groundedpartly groundedopen

5 conditions, all required.

5Required in every casenumbered 1–5

These hold no matter which pattern applies.

1

Indivisible options · grounded

Options are indivisible or all-or-nothing. more

primeInteger Linear Programming (ILP)— Discrete optimization with integer variables.

and — also required

2

Constraint-coupled choices · grounded · any one of 3

Choices interact through shared constraints. more

a

domainDependency Hell— The pathological state where a project's transitive dependency closure holds mutually incompatible version constraints, turning installation into an NP-complete constraint-satisfaction problem that no edge-level patch can resolve.

or — any one of these establishes this case

b

domainEl Farol Bar Problem— The congestion model in which each agent independently decides whether to attend a capacity-limited bar, enjoyable only if uncrowded — so any prediction rule shared by all self-destructs, and the system resolves only through heterogeneous inductive predictors rather than convergence.

or — any one of these establishes this case

c

domainHoldout Problem— The bargaining failure in which a complementary surplus requiring unanimous consent lets any pivotal, non-substitutable party refuse agreement and extract a disproportionate share as the price of consent — making rational extraction, not bad faith, the equilibrium.

How this was matched — 3 requirements, all needed

Multiple choices are coupled by constraints they share.

All of

• quantifierMultiple choices are involved.
• roleConstraints are shared across the choices.
• relationThe choices interact or are coupled through the shared constraints.

and — also required

3

Integer commitment requirement · grounded

Whole-number quantities, slots, or commitments are required. more

primeInteger Linear Programming (ILP)— Discrete optimization with integer variables.

and — also required

4

Binding allocation constraints · grounded · any one of 9

Fairness, eligibility, compatibility, or exclusion constraints bind. more

a

domainDependency Hell— The pathological state where a project's transitive dependency closure holds mutually incompatible version constraints, turning installation into an NP-complete constraint-satisfaction problem that no edge-level patch can resolve.

or — any one of these establishes this case

b

domainNavigation loop— Diagnose a workflow where a user cannot reach their goal by modeling the interface as a directed graph and asking one structural question — is any goal state reachable from the current state? — rather than blaming screen quality or user confusion.

or — any one of these establishes this case

c

domainHoldout Problem— The bargaining failure in which a complementary surplus requiring unanimous consent lets any pivotal, non-substitutable party refuse agreement and extract a disproportionate share as the price of consent — making rational extraction, not bad faith, the equilibrium.

or — any one of these establishes this case

d

domainProblem-Solution Fit— The lean-startup gate that demands cheap, need-side evidence — a real, important problem for an identified user, and a solution preferred over their current workaround — before committing to build at scale, guarding against 'build it and they will come.'

or — any one of these establishes this case

e

domainTrembling-Hand Perfect Equilibrium— Filter the Nash equilibria by giving every action a vanishing positive probability of being played by mistake and keeping only those that survive as the tremble shrinks to zero, discarding equilibria propped up by threats that never have to be carried out.

or — any one of these establishes this case

f

domainFLP Impossibility— Prove that no deterministic algorithm can guarantee both agreement and termination for consensus in an asynchronous system with even one crash-fault — by showing an adversarial message schedule can keep the system perpetually undecided.

or — any one of these establishes this case

g

domainMerge Conflict— Halt an automatic merge and hand the decision to a human exactly where two branches diverged from their common ancestor on the same region, because a three-way merge over text can rank a one-sided edit but has no syntactic basis to choose between two competing edits whose correctness lives in intent it cannot see.

or — any one of these establishes this case

h

domainHalting Problem— Turing's proof that no general algorithm can decide, for every program-input pair, whether the program halts or loops forever — established by a diagonal argument that builds an adversary doing the opposite of any claimed decider's prediction about itself.

or — any one of these establishes this case

i

domainMoving the goalposts— An argumentative pattern in which, on being shown evidence that meets a previously stipulated standard, one party revises the standard upward to block the conclusion rather than accept it — repeated so that no finite evidence can settle the question.

How this was matched — 1 shared + 4 branches

One listed constraint type is binding.

All of

• relationThe selected constraint is binding on the focal decision or configuration.

…and any one of

• domainThe binding constraint concerns fairness.
• domainThe binding constraint concerns eligibility.
• domainThe binding constraint concerns compatibility.
• domainThe binding constraint concerns exclusion.

and — also required

5

Continuous treatment mismatch · open

Decision-makers currently use a fractional, smoothly ranked, or one-option-at-a-time treatment that violates the discrete coupled structure. more

Other requirements and context (2)

Why these sit outside the expression

Supporting context — it may accompany or help interpret the situation, but it is not a load-bearing condition in a sufficient diagnostic set.

• Supporting contextThe number of feasible combinations is too large for informal enumeration. more

• Supporting contextSelected commitments create durable implementation consequences. more

Coverage

4 of 5 conditions grounded · 1 open.

Read the methodology · Download the trigger-logic data

When to Use This Archetype

Use this archetype when choices are indivisible, when whole-number quantities matter, or when assignments and placements must be made as complete commitments. It is especially useful when a simple ranked list keeps producing infeasible or politically contested results because the selected items interact with each other.

It also fits when the decision space grows combinatorially. If every project, site, contract, feature, or assignment can be either selected or not selected, the number of possible bundles can become too large for intuition. The archetype does not require a formal solver, but it does require explicit representation of the choice units, constraints, feasible combinations, and selection rule.

Structural Problem

The structural problem is false continuity. Decision-makers may reason as if options can be partially funded, smoothly adjusted, or independently ranked, while the real world demands whole commitments. A fractional or locally attractive answer then fails at implementation: projects cannot be half-launched, coverage requirements are missed, dependencies are broken, or a rounded answer violates capacity.

A second structural problem is bundle interaction. Each option may look good alone, but the selected set can be poor because choices share budgets, staff, space, deadlines, political legitimacy, or technical dependencies. Discrete commitment problems therefore require combination-level feasibility, not just option-level scoring.

Intervention Logic

The intervention begins by naming the indivisible units: projects, sites, people, shifts, vendors, routes, features, assets, or slots. It then represents each unit as a binary, integer, assignment, or categorical decision. The objective defines what a good bundle means, while constraints define what bundles are feasible.

The decision process then compares feasible bundles. In some domains this is done with an integer programming model or solver. In others it is done through a transparent project-selection matrix, staged narrowing, constraint satisfaction search, or a human review board. The mechanism can vary, but the intervention logic remains the same: choose implementable commitments as a coherent set, not as isolated preferences.

Key Components

Discrete Commitment Optimization is built around the fact that some decisions cannot be averaged or interpolated, so its first job is to represent the choice in implementable units. The Indivisible Option Set names the projects, sites, assignments, or contracts that can only be taken whole. The Binary Decision Variable records in/out for each such option, while an Integer Constraint handles cases where the question is whole-number quantity rather than yes/no. The Objective Function declares what a good bundle improves — coverage, equity, throughput, cost, strategic value — and must remain inspectable because it usually encodes contested judgments. Together these four components reframe the problem so that the decision object is a combination of commitments rather than a ranked list of isolated options.

The remaining components govern which combinations are admissible and how one of them is selected and made real. Coupling Constraint captures the dependencies, exclusions, shared budgets, and minimum-coverage rules that make a bundle stand or fall as a unit; these constraints are precisely why simple ranking can fail. The Combinatorial Feasible Set is the conceptual space of bundles that satisfy all hard constraints, and the Selection Rule — exact solver, heuristic search, review board, or hybrid — picks one feasible bundle and provides enough rationale for the stakes involved. The Feasibility Audit re-checks the chosen bundle against constraints and implementation realities after any rounding or heuristic step, and the Implementation Commitment Record documents what was selected and rejected, by whom, under what assumptions, and when the decision should be revisited so that the lock-in created by discrete choices remains visible and reviewable.

Component	Description
Indivisible Option Set ↗	The indivisible option set defines what can be selected only as a whole: a project, site, contract, worker assignment, feature, route, or asset. Without this component, the decision can slip back into false fractional thinking.
Binary Decision Variable ↗	A binary decision variable records whether a candidate commitment is in or out. It is not the archetype itself; it is a representation component that helps make yes/no commitments explicit.
Integer Constraint ↗	An integer constraint requires whole-number quantities. It matters when the decision is not merely yes/no but still cannot be fractional, such as choosing the number of vehicles, servers, beds, staff positions, or batches.
Objective Function ↗	The objective function states what the selected bundle is meant to improve. It may be impact, coverage, throughput, equity, cost, reliability, or strategic value. It should remain inspectable because objectives often encode value judgments.
Coupling Constraint ↗	A coupling constraint captures interactions among choices: dependencies, mutual exclusions, shared budgets, compatibility, timing, or minimum coverage. Coupling constraints are the reason a simple ranked list can fail.
Combinatorial Feasible Set ↗	The combinatorial feasible set is the set of bundles that satisfy all hard constraints. It may be too large to list manually, but it must be conceptually explicit: some combinations are possible and others are not.
Selection Rule ↗	The selection rule says how the final feasible bundle is chosen. It may be exact optimization, heuristic search, a deliberative procedure, or a hybrid. The rule must preserve feasibility and provide enough explanation for the stakes of the decision.
Feasibility Audit ↗	The feasibility audit checks whether the proposed bundle actually respects constraints, assumptions, and implementation realities. It is especially important after rounding, heuristic search, or solver output.
Implementation Commitment Record ↗	The implementation commitment record documents what was selected, what was rejected, why, by whom, under what assumptions, and when the decision should be revisited. Discrete choices often create obligations and lock-in, so documentation is part of the intervention.

Common Mechanisms

Integer programming models and solvers are common mechanisms when the problem can be formalized. They can search large discrete spaces and return candidate solutions, but they do not decide whether the objective, constraints, and candidate universe are legitimate.

Branch-and-bound procedures are search mechanisms. They help explore large decision spaces by pruning regions that cannot improve on current candidates. They implement part of the search logic but should not be confused with the archetype.

Assignment models and matching algorithms implement the assignment variant. They are useful when agents, tasks, slots, or resources must be paired under compatibility and capacity constraints.

Facility location models implement the siting variant. They help choose which sites to open, close, place, or reserve under cost, coverage, access, and capacity constraints.

Project selection matrices and selection review boards are governance mechanisms. They make commitments, constraints, dependencies, and rationales visible for human review, especially when solver precision would be inappropriate or insufficient.

Solver dashboards are interface mechanisms. They help inspect solutions and constraint reports, but they are not substitutes for the archetype’s objective, constraint, feasibility, and accountability logic.

10 catalogued mechanisms: 9 documented across 5 implementation forms; 1 awaits an authored page and reviewed form classification.

The grouping reflects forms represented among the mechanisms currently documented for this archetype; an absent form is not necessarily an impossible implementation.

Analysis, Modeling & Optimization · 4 mechanisms

• Constraint Satisfaction Search — Explores the space of discrete combinations to find any assignment that violates no constraint, driven by feasibility rather than an objective.
• Crew Scheduling Model — Builds legal duty bundles that cover every required shift under labor rules, minimum staffing, and equitable distribution of work.
• Facility Location Model — Chooses which whole sites to open so that demand is covered at acceptable cost and distance.
• Integer Programming Solver — Software that searches a formulated discrete model's feasible space and returns a proven or near-optimal commitment bundle.

Decision, Gate & Allocation · 1 mechanism

• Assignment Model — Represents pairings between agents and tasks as an eligibility grid, then commits each agent to exactly one compatible partner.

Monitoring, Sensing & Alerting · 1 mechanism

• Solver Dashboard — A live interface that visualizes a running solver — its candidate solutions, objective values, remaining gap, and constraint violations.

Organization, Role & Governance · 1 mechanism

• Selection Review Board — A standing human body that deliberates over a proposed commitment bundle, rules on exceptions and fairness, and takes accountable ownership of the decision.

Representation, Specification & Plan · 2 mechanisms

• Integer Programming Model — A formal declarative statement of a discrete decision — its binary and whole-number variables, objective, and constraints — written to be handed to a solver.
• Project Selection Matrix — A structured table laying out candidate projects with their scores, costs, dependencies, and selection status for transparent human review.

Not Yet Form-Classified · 1 mechanism

• Branch-and-Bound Procedure — Uses bounds to avoid exploring branches of a combinatorial search tree that cannot improve the current best solution.

Parameter / Tuning Dimensions

Important tuning dimensions include option granularity, constraint hardness, objective weighting, search exactness, commitment reversibility, fairness guardrails, and re-selection cadence. Poor granularity can hide meaningful alternatives; weak constraints can produce infeasible bundles; excessive exactness can make an uncertain model look more authoritative than it deserves.

The most important tuning question is whether the representation matches the implementable action. If the real system can only approve whole projects or assign whole people, the decision representation must preserve that indivisibility.

Invariants to Preserve

The first invariant is indivisibility preservation: the selected answer must be made of units that can actually be implemented. The second is full-bundle feasibility: all selected commitments must coexist under shared constraints.

The third invariant is objective and constraint traceability. Observers should be able to see why this bundle was selected and what rules shaped the decision. The fourth is implementation accountability: selected commitments create obligations, costs, owners, and dependencies that must be visible after selection.

Target Outcomes

The archetype should produce commitment bundles that are feasible, implementable, and better aligned with stated objectives than ad hoc or rank-only selection. It should reduce hidden dependency failures, rounding failures, and bundle-level contradictions.

It should also improve legitimacy where decisions are contested. Even if stakeholders disagree with the final bundle, they should be able to inspect the candidate set, constraints, objective, and selection rationale.

Tradeoffs

Discrete commitment optimization can improve global fit, but it can also reduce transparency if the mechanism is too technical. Exact solvers may produce strong answers for well-modeled problems, but they can launder hidden value judgments when objectives and constraints are not reviewable.

There is also a granularity tradeoff. Smaller units create more flexibility but more complexity; larger bundles simplify the decision but may hide important alternatives. Finally, discrete commitments enable decisive action but may create lock-in and reversal costs.

Failure Modes

A common failure mode is false divisibility: a continuous or fractional solution is accepted even though the real system requires whole commitments. Another is greedy local selection, where the highest-ranked individual options are selected even though a different bundle would perform better.

Hidden constraint violation is especially common in assignment, scheduling, procurement, and public-service decisions. A bundle may satisfy visible budget constraints but violate compatibility, fairness, timing, or implementation constraints. Objective laundering is another risk: a model can hide contested value judgments inside weights, scores, or solver settings.

Neighbor Distinctions

Constrained Resource Allocation distributes divisible resources across uses. Discrete Commitment Optimization chooses whole commitments or whole-number quantities. The question is not just “how much goes where?” but “which commitments are made at all?”

Network Flow Optimization routes flow through nodes and edges subject to capacity and conservation rules. Discrete Commitment Optimization may choose a route, site, or network asset as a whole commitment, but it is not primarily about continuous flow allocation.

Bounded Search Pruning is a search logic that may support this archetype. It removes branches that cannot dominate. Discrete Commitment Optimization is the broader commitment-selection pattern that may use pruning, solvers, heuristics, or review boards.

Priority-Based Admission orders access to limited opportunities or capacity. Discrete Commitment Optimization selects a feasible bundle or assignment set, often with multiple coupling constraints beyond priority ordering.

Assignment / Matching Optimization is recorded here as a candidate variant and possible second-wave promotion candidate. It should not be drafted separately until saturation review confirms that its matching-specific components and failure modes require their own archetype.

Cross-Domain Examples

In capital budgeting, a government selects a feasible bundle of infrastructure projects under budget, coverage, mandate, and contractor-capacity constraints. In workforce operations, a hospital assigns nurses to shifts while preserving skills, rest requirements, and minimum coverage.

In product strategy, a team chooses a feature release bundle where dependencies and shared engineering capacity matter. In procurement, a company selects vendor contracts or license bundles that are indivisible and mutually constrained. In education, a school assigns students to course sections while preserving prerequisites, capacities, and fairness rules.

Non-Examples

A proportional budget split across departments is usually Constrained Resource Allocation unless the split funds indivisible projects. Buying an integer-programming solver is not this archetype; it is acquiring a mechanism.

Rejecting an option because it violates a categorical safety or legal rule is not optimization; it is feasibility exclusion. Routing continuous flow through a network is not this archetype unless the main decision is selecting whole routes, facilities, or assets.

Related Abstractions

Abstractions this archetype builds on — directly (a source ingredient) or as a related pattern. Links follow the typed catalog namespace.

Built directly on (3)

• Discreteness: Countable steps.
• Integer Linear Programming (ILP): Discrete optimization with integer variables.
• Optimization: Finds best solution under constraints.

Also references 6 related abstractions

• Cardinality: Size of sets.
• Complexity (Time/Space): Resource scaling with input size.
• Constraint: Limits possibilities to guide outcomes.
• Coupling: Interdependence among subsystems.
• Resource Management: Allocation of finite assets.
• Scheduling: Organizing tasks over time.

Variants

Narrower or domain-specific specializations that share this archetype's core structure. Recognized variants are established; candidate variants are provisional.

Binary Project Selection · subtype · recognized

Choose which indivisible projects, proposals, features, or initiatives to accept when each candidate is essentially yes-or-no.

• Distinct from parent: The parent also covers integer quantities and assignments; this variant centers on binary inclusion/exclusion.
• Use when: {'condition': 'Each option must be accepted, rejected, funded, built, hired, purchased, or approved as a whole.'}; {'condition': 'The number of possible bundles is large enough that simple ranking may miss feasible or better combinations.'}; {'condition': 'Budget, staffing, timing, dependency, eligibility, or risk constraints bind across the bundle.'}.
• Typical domains:
• Common mechanisms: Project Selection Matrix, Integer Programming Model

Integer Quantity Commitment · subtype · recognized

Choose whole-number quantities of units, slots, staff, licenses, batches, or assets when fractional quantities are impossible or meaningless.

• Distinct from parent: The parent covers all discrete choices; this variant emphasizes integral quantities rather than binary selection.
• Use when: {'condition': 'The decision variable can take more than two values but only in whole units.'}; {'condition': 'Unit counts interact with capacity, staffing, timing, compatibility, or minimum-scale constraints.'}; {'condition': 'Rounding a continuous allocation would produce infeasible or misleading commitments.'}.
• Typical domains:
• Common mechanisms: Integer Programming Model, Capacity Sizing Model

Assignment / Matching as Discrete Commitment · subtype · candidate

Assign agents, tasks, slots, resources, or roles to one another when each match is a discrete commitment constrained by capacity and compatibility.

• Distinct from parent: The parent covers discrete commitments generally; this variant focuses on pairings or slot assignments.
• Use when: {'condition': 'Entities must be paired, matched, or assigned rather than fractionally allocated.'}; {'condition': 'Compatibility, capacity, fairness, availability, or preference constraints shape feasible matches.'}; {'condition': 'Naive first-come or local matching creates overload, mismatch, or unfairness.'}.
• Typical domains:
• Common mechanisms: Assignment Model, Matching Algorithm

Facility Location Commitment · domain variant · recognized

Choose which physical or logical sites to open, close, place, or reserve when each site is an indivisible commitment with network effects.

• Distinct from parent: The parent is not inherently spatial; this variant adds location, coverage, and access structure.
• Use when: {'condition': 'Potential sites are discrete and cannot be partially opened in a meaningful way.'}; {'condition': 'Each selected site changes coverage, access, cost, routing, or downstream capacity.'}; {'condition': 'Siting decisions have durable implementation consequences.'}.
• Typical domains:
• Common mechanisms: Facility Location Model, Site Selection Review

Near names: Integer Optimization, Integer Linear Programming, 0-1 Optimization, Combinatorial Selection, Assignment Problem, Project Portfolio Selection, Facility Location, Integer Programming Solver, Assignment Algorithm.

Editorial Notes

Problem Classification

Classification: Decision, Search & Optimization Failure → Allocation, Matching & Opportunity Cost

Problem kernel: indivisible commitments are treated as smoothly divisible

Rationale: Whole-number assignments and placements cannot be optimized by fractional intuition or independent ranking without violating feasibility.

Independent corroboration: The earliest necessary condition in the frozen evidence is: A decision involves indivisible commitments, assignments, selections, placements, or whole-number quantities, but decision-makers treat the problem as if options could be smoothly ranked, fractionally allocated, or considered one at a time. That is a allocation matching and opportunity cost problem because Discrete agents, tasks, resources, or commitments are assigned without counterpart fit, indivisibility, comparative advantage, or visibility into displaced alternatives.

Review outcome: Independent reviewer agreement; high confidence.