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 Multipliers→→Long-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 Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Literal Equations → Slope-Intercept Form → Point-Slope Form → Writing Linear Equations → Parallel and Perpendicular Line Slopes → Graphing Linear Equations → Piecewise Functions → One-Sided Limits → Continuity Definition → Limits and Continuity in Multiple Variables → Functions of Several Variables → Continuity in Multiple Variables → Partial Derivatives: Definition and Computation → Differentiability in Multiple Variables → Differentiability in Multivariable Functions → Total Differential and Linear Approximation → Chain Rule for Multivariable Functions → Implicit Differentiation → Related Rates → Optimization Problems → Critical Points of Multivariable Functions → Critical Points and Classification of Extrema → Second Partial Test for Local Extrema (Hessian) → The Hessian Matrix and Second Derivative Test → Unconstrained Optimization: Finding Extrema → Optimization in Multiple Variables → Lagrange Multipliers → Cost Minimization and Conditional Input Demand

Longest path: 89 steps · 427 total prerequisite topics

Prerequisites (2)

Leads To (1)