A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Cost Minimization and Conditional Input Demand

College Depth 88 in the knowledge graph I know this Set as goal
362topics build on this
427prerequisites beneath it
See this on the map →
Production Technology and Isoquant AnalysisLagrange MultipliersLong-Run Cost Curves and Scale Economies
producer theory costs optimization factor demand

Core Idea

Firms minimize the cost of producing a target output by choosing input quantities where the price ratio equals the marginal rate of technical substitution (w/r = MRTS). Conditional input demands x*(w,r,y) show how many inputs to use at given prices and output. The cost function c(w,r,y) gives minimum cost for each output level; its properties (homogeneity, concavity) derive from technology.

Explainer

From your study of isoquants, you know that an isoquant is a curve showing all input combinations — say, labor L and capital K — that produce the same quantity of output. The slope of an isoquant at any point is the marginal rate of technical substitution (MRTS), the rate at which you can substitute one input for another while holding output constant. MRTS equals the ratio of the marginal products: MRTS = MP_L / MP_K. Cost minimization is about finding the right point on an isoquant — the one that costs the least.

The cost of an input bundle (L, K) at wage w and rental rate r is simply wL + rK. If you set this equal to a fixed budget, you get an isocost line: L = C/w − (r/w)K. The slope of the isocost line is −r/w (or −w/r when expressed in the conventional orientation). The cost-minimizing input bundle is where an isocost line is tangent to the target isoquant. At this tangency point, the slopes are equal: MRTS = w/r. This tangency condition has an intuitive interpretation: at the optimum, the last dollar spent on labor buys as much output as the last dollar spent on capital — if it didn't, you could reallocate spending between inputs and produce the same output more cheaply.

This optimality condition defines the conditional input demands — the functions L*(w, r, y) and K*(w, r, y) that tell the firm how much of each input to hire to produce output y at minimum cost, given prices w and r. They are "conditional" because they depend on the output target y, not on the profit motive directly. Plugging these back into the cost expression gives the cost function c(w, r, y) = wL* + rK*, which summarizes everything about the firm's production technology. The cost function is homogeneous of degree one in input prices — doubling both w and r doubles costs without changing optimal input ratios — and it is concave in input prices, reflecting the firm's ability to substitute toward cheaper inputs when prices change.

If you have studied Lagrange multipliers, you can derive the same result formally: minimize wL + rK subject to the constraint f(L, K) = y. The first-order conditions yield w = λ · MP_L and r = λ · MP_K, where λ is the Lagrange multiplier (here, the marginal cost of output). Dividing one condition by the other gives MP_L / MP_K = w/r, confirming the tangency condition. The Lagrange multiplier λ plays a central role in producer theory: it is the shadow price of relaxing the output constraint by one unit — that is, the marginal cost of production. Shephard's lemma then tells us that the derivative of the cost function with respect to an input price equals the conditional demand for that input: ∂c/∂w = L*(w, r, y). This powerful result means you can recover input demands from the cost function without solving the optimization problem again.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersDividing IntegersUnit RatesProportionsPercent ConceptConverting Between Fractions, Decimals, and PercentsOperations with Rational NumbersTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesLiteral EquationsSlope-Intercept FormPoint-Slope FormWriting Linear EquationsParallel and Perpendicular Line SlopesGraphing Linear EquationsPiecewise FunctionsOne-Sided LimitsContinuity DefinitionLimits and Continuity in Multiple VariablesFunctions of Several VariablesContinuity in Multiple VariablesPartial Derivatives: Definition and ComputationDifferentiability in Multiple VariablesDifferentiability in Multivariable FunctionsTotal Differential and Linear ApproximationChain Rule for Multivariable FunctionsImplicit DifferentiationRelated RatesOptimization ProblemsCritical Points of Multivariable FunctionsCritical Points and Classification of ExtremaSecond Partial Test for Local Extrema (Hessian)The Hessian Matrix and Second Derivative TestUnconstrained Optimization: Finding ExtremaOptimization in Multiple VariablesLagrange MultipliersCost Minimization and Conditional Input Demand

Longest path: 89 steps · 427 total prerequisite topics

Prerequisites (2)

Leads To (1)