Historical Context & Motivation
Every firm faces limits—machine hours, labor hours, raw materials, or warehouse space—that prevent it from producing unlimited quantities of every product in its portfolio. For much of early industrial history, managers relied on intuition or simple rules of thumb to decide which products deserved scarce capacity. A product with a higher selling price often received priority, even when it consumed a disproportionate share of the bottleneck resource. The result was sub-optimal profits and, in many cases, outright losses on specific product lines that appeared lucrative but devoured the constraint. The evolution of contribution margin analysis and, later, Theory of Constraints (TOC) formalized a remarkably powerful yet simple idea: rank products not by their total contribution margin per unit, but by the contribution margin they earn per unit of the binding constraint.
The central question that this concept addresses is deceptively straightforward: When capacity is limited, which products should a firm produce more of, and which should it scale back? As we will see, the answer hinges not on the product with the highest per-unit contribution margin, but on the product that squeezes the most contribution margin out of every scarce unit of the binding constraint.
Core Principles & Definitions
Before diving into calculations, it is essential to anchor the discussion in a few foundational ideas that underpin every product-mix decision under a single binding constraint. Each principle builds on the previous one, culminating in the decision rule that drives optimal prioritization.
Contribution Margin (CM)
Binding Constraint
CM Per Constraint Unit
Short-Run Decision Horizon
Demand Ceiling
Visual Explanation
The diagram below illustrates the core decision logic. Three products compete for a single binding constraint—machine hours. Although Product B has the highest CM per unit, Product A generates the greatest CM per machine hour and therefore receives top priority in the optimal product mix.
The visual makes a critical lesson concrete: a product's apparent profitability (measured by CM per unit) can be misleading when a scarce resource is involved. The CM per constraint unit metric strips away that illusion by normalizing each product's contribution to the common denominator of the bottleneck. Once ranked, the firm allocates available constraint capacity to the top-ranked product first, filling demand up to its ceiling, and then moves to the second-ranked product, and so on, until the constraint is exhausted.
Mathematical Framework
The mathematical structure of this technique is intentionally accessible, requiring only basic arithmetic once the relevant data have been gathered. Three equations form the analytical backbone, and a fourth expression captures the optimal allocation procedure.
Step-by-Step Allocation Process
Knowing how to compute CM per constraint unit is necessary but not sufficient; the real payoff comes from applying the ranking to build an optimal production plan. The following diagram walks through the sequential allocation procedure, which mirrors how firms actually schedule production when capacity is tight.
A common error students make is allocating constraint proportionally across products rather than sequentially. Proportional allocation sounds fair, but it sacrifices total contribution margin because it diverts scarce capacity away from the most profitable use per constraint unit. The greedy sequential method is mathematically guaranteed to maximize total CM when there is exactly one binding constraint and demand ceilings are known.
Worked Example
Greenfield Manufacturing produces three products—Alpha, Beta, and Gamma—using a single production line. The binding constraint is machine hours, of which 2,400 hours are available per month. The following data are provided:
| Item | Alpha | Beta | Gamma |
|---|---|---|---|
| Selling price per unit | $100 | $150 | $80 |
| Variable cost per unit | $60 | $90 | $50 |
| CM per unit | $40 | $60 | $30 |
| Machine hours per unit | 2 hrs | 5 hrs | 1.5 hrs |
| Max monthly demand (units) | 400 | 200 | 500 |
Strengths, Limitations & Assumptions
Like every managerial tool, CM per constraint unit analysis carries both powerful advantages and important limitations that practitioners must understand before applying it. The table below contrasts the technique's strengths against its boundary conditions.
| Strengths | Limitations |
|---|---|
| Simple to calculate—requires only price, variable cost, and constraint usage data. | Assumes a single binding constraint. If two or more resources are simultaneously scarce, linear programming is needed. |
| Produces a provably optimal product mix under the single-constraint assumption. | Ignores qualitative factors—customer relationships, contractual obligations, or strategic market presence. |
| Easy to communicate to non-accounting managers and shop-floor supervisors. | Assumes variable costs and prices are constant within the relevant range; economies of scale or price discounting are not captured. |
| Focuses attention on the bottleneck, aligning accounting analysis with operations management. | Short-run only—does not consider capital investment to relieve the bottleneck in the long run. |
| Directly tied to contribution margin, making it consistent with CVP analysis frameworks. | Treats demand ceilings as known and fixed, ignoring demand uncertainty. |
Connection to Advanced Theory
The introductory CM per constraint unit technique sits at the foundation of a broader family of constrained optimization tools. Understanding where this method ends and more sophisticated tools begin is essential for advanced coursework and real-world applications.
| Dimension | CM per Constraint Unit (This Lesson) | Linear Programming / TOC |
|---|---|---|
| Number of constraints | Single binding constraint only | Multiple simultaneous constraints |
| Solution method | Greedy algorithm (rank & fill) | Simplex method, sensitivity analysis |
| Optimality guarantee | Yes, for single-constraint case | Yes, for any number of linear constraints |
| Time horizon | Short-run (fixed capacity) | Short- to medium-run; TOC also considers continuous improvement |
| Complexity | Minimal—hand calculation feasible | Moderate to high—software typically required |
In subsequent coursework, you will encounter scenarios with two or more binding constraints—for example, both machine hours and direct labor hours might be scarce. In those cases, the simple ranking approach breaks down because producing more of the product ranked first on one constraint may consume excessive capacity on the second constraint. Linear programming resolves this by simultaneously satisfying all constraints and identifying the optimal corner-point solution on the feasible region. Goldratt's Theory of Constraints (TOC) extends the idea further by asking not just how to exploit the bottleneck, but how to elevate it—investing to increase bottleneck capacity so the firm can grow total throughput over time.
Practice Problems
Lesson Summary
When a firm faces a single binding constraint—such as limited machine hours, labor hours, or raw materials—the key to maximizing profit is to rank products by contribution margin per unit of the constraint (CM per CU), not by CM per unit alone. The formula is straightforward: divide each product's CM per unit by the amount of the scarce resource it consumes per unit. Products with the highest CM per CU receive priority access to constrained capacity, and the firm allocates sequentially—filling demand for the top-ranked product first, then the second, and so on—until the constraint is exhausted.
This technique is powerful but bounded by key assumptions: a short-run time horizon with fixed capacity, known demand ceilings, constant variable costs, and exactly one binding constraint. When multiple constraints bind simultaneously, linear programming is required. Nevertheless, CM per constraint unit remains the foundational decision criterion in managerial accounting for product-mix optimization and is a critical building block for Theory of Constraints (TOC) and advanced operations management.