Intermediate Microeconomics and Mathematical Optimization Techniques

Foundations of Intermediate Microeconomics and Economic Modeling

  • Primary Focus of Microeconomics:

    • Microeconomics primarily focuses on two main interconnected topics:
    • Individual Economic Agents: Analysis of individual economic decision-makers, specifically consumers, households, and business firms. The emphasis is on understanding their choice behavior and the processes by which they make decisions.
    • Market Outcomes: Examination of the aggregate results generated when individual agents interact within markets. Key outcomes include price determination, the volume/quantity of trade, and the overall well-being (welfare) of economic participants.
  • Model of Individual Choice Behavior:

    • The standard model assumes that every economic agent has a well-defined goal (objective function) and operates under specific constraints.
    • Agents select actions to optimize their objective function subject to those constraints.
    • In classic economic models, agents are treated as highly proficient problem solvers capable of executing complex optimization problems.
    • Behavioral Economics: A distinct branch of economics that incorporates real-world human cognitive limitations and frailties into choice models, particularly in environments involving uncertainty or multi-period decision horizons. (This course focuses predominantly on classical optimization models rather than behavioral economics).
  • Market Outcomes and Equilibrium:

    • Economic outcomes observed in real-world markets are presumed to be at, or moving toward, an equilibrium.
    • An equilibrium is defined as a state where the individual choices of all interacting agents are mutually consistent.
    • Every agent's choice in equilibrium represents an optimal solution to their individual choice problem, given the economic environment created by all other participants.
  • Mathematical Toolkit Required for Intermediate Microeconomics (ECO 420K):

    • Calculus: Proficiency in calculating partial derivatives and understanding their geometric and quantitative mechanics.
    • Algebra: Competence in setting up and solving systems of simultaneous linear and non-linear equations.
    • Graphing: Capability to construct and interpret two-dimensional graphs representing economic relationships, constraint curves, and functions.
    • Probability Theory: Ability to calculate expected values for economic decisions made under uncertainty.
    • Integration: Conceptual understanding of integrals (though direct calculation of integrals is rarely required in this course).

Single-Variable Calculus and Unconstrained Optimization

  • Single-Variable Functions:

    • Represented mathematically as y=f(x)y = f(x).
    • Defines a rule that assigns a unique single value of yy to every possible value of xx within its domain.
  • Formal Definition of a Derivative:

    • For a smooth, continuous function, the derivative measures the rate of change of the function with respect to xx.
    • Mathematically defined as the limit of a ratio of changes as the change in xx approaches zero:     dfdx=lim⁡Δx→0f(x0+Δx)−f(x0)Δx\frac{df}{dx} = \lim_{\Delta x \to 0} \frac{f(x_0 + \Delta x) - f(x_0)}{\Delta x}
  • Geometric Interpretation of the Derivative:

    • Graphically, the numerator f(x0+Δx)−f(x0)f(x_0 + \Delta x) - f(x_0) represents the vertical rise, while the denominator \\Delta x\ represents the horizontal run between two points on the function.
    • The ratio represents the slope of the secant chord connecting these two points.
    • As Δx→0\Delta x \to 0, the secant line converges to the tangent line at point x0x_0, making the derivative the exact slope of the function at that point.
  • Sign of the Derivative:

    • Positive Derivative (dfdx>0\frac{df}{dx} > 0): The function has a positive slope and is strictly increasing at that point.
    • Negative Derivative (dfdx<0\frac{df}{dx} < 0): The function has a negative slope and is strictly decreasing at that point.
    • Zero Derivative (dfdx=0\frac{df}{dx} = 0): The function has a flat slope and is stationary (neither increasing nor decreasing).
  • Second Derivative:

    • The derivative of the first derivative, written as d2fdx2\frac{d^2f}{dx^2} or f′′(x)f''(x).
    • Measures the rate of change of the slope of the original function.
    • Positive Second Derivative (f′′(x)>0f''(x) > 0): The slope is increasing (the function is convex/turning upwards).
    • Negative Second Derivative (f′′(x)<0f''(x) < 0): The slope is decreasing (the function is concave/turning downwards).
    • Zero Second Derivative (f′′(x)=0f''(x) = 0): The slope is stationary with respect to xx.
  • Optimization Conditions for Single-Variable Functions:

    • Local Interior Maximum:
    • First Order Condition (FOC): f′(x)=0f'(x) = 0
    • Second Order Condition (SOC): f′′(x)<0f''(x) < 0
    • Analogy: Driving a car to the crest of a hill on a straight road. At the top of the hill, the surface is flat (f′(x)=0f'(x) = 0), and the slope is transitioning from positive (ascending) to negative (descending), meaning slope is decreasing (f′′(x)<0f''(x) < 0).
    • Local Interior Minimum:
    • First Order Condition (FOC): f′(x)=0f'(x) = 0
    • Second Order Condition (SOC): f′′(x)>0f''(x) > 0
    • Analogy: Driving to the exact bottom of a dip or basin in a road. At the lowest point, the surface is flat (f′(x)=0f'(x) = 0), and the slope transitions from negative (descending) to positive (ascending), meaning slope is increasing (f′′(x)>0f''(x) > 0).
  • Global vs. Local Optima:

    • Finding local optima via FOC and SOC does not automatically guarantee a global optimum.
    • In general arbitrary functions, identifying global optima requires comparing function values across all local optima and evaluating boundary points at the extremes of the function's domain.
    • Concave Functions:
    • Defined by f′′(x)≤0f''(x) \le 0 for all values of xx in the domain.
    • Any point satisfying the FOC f′(x)=0f'(x) = 0 is guaranteed to be the unique global maximum.
    • Convex Functions:
    • Defined by f′′(x)≥0f''(x) \ge 0 for all values of xx in the domain.
    • Any point satisfying the FOC f′(x)=0f'(x) = 0 is guaranteed to be the unique global minimum.
  • Essential Single-Variable Differentiation Rules:

    • Constant Rule: ddx(c)=0\frac{d}{dx}(c) = 0
    • Power Rule for Polynomials: ddx(a⋅xb)=a⋅b⋅xb−1\frac{d}{dx}(a \cdot x^b) = a \cdot b \cdot x^{b-1}
    • Natural Logarithm Rule: ddx(ln⁡(x))=1x\frac{d}{dx}(\ln(x)) = \frac{1}{x}
    • Compound Function Rules: Sum rule, product rule, and quotient rule.
    • Chain Rule: For composite functions where y=f(x)y = f(x) and x=g(z)x = g(z):     dydz=dydx×dxdz\frac{dy}{dz} = \frac{dy}{dx} \times \frac{dx}{dz}

Multi-Variable Calculus and Partial Differentiation

  • Economic Context of Multi-Variable Choice:

    • Economic problems almost universally involve trade-offs among multiple choice variables.
    • Consumer Problem: Consumers choose optimal consumption quantities across a multi-product basket of goods to maximize satisfaction subject to limited income.
    • Firm Production Problem: Producers select combinations of multiple input factors (e.g., labor, capital, raw materials) to produce a targeted output level at minimum cost.
    • Political Campaign Allocation Problem: A political campaign allocates finite advertising budgets across multiple distinct media markets (e.g., Market A, Market B, Market C) to maximize the probability of winning an election.
    • Modelling Choice: To balance mathematical tractability with visual intuition, economic models frequently focus on two choice variables (x1,x2x_1, x_2). This allows two-dimensional diagrammatic representation while retaining full generalizability to nn variables.
  • First-Order Partial Derivatives:

    • For a function of two variables y=f(x1,x2)y = f(x_1, x_2), a partial derivative measures the rate of change of the function with respect to one variable while holding all other variables constant.
    • Partial Derivative with respect to x1x_1:     ∂f∂x1=lim⁡Δx1→0f(x1+Δx1,x2)−f(x1,x2)Δx1\frac{\partial f}{\partial x_1} = \lim_{\Delta x_1 \to 0} \frac{f(x_1 + \Delta x_1, x_2) - f(x_1, x_2)}{\Delta x_1}
    • Partial Derivative with respect to x2x_2:     ∂f∂x2=lim⁡Δx2→0f(x1,x2+Δx2)−f(x1,x2)Δx2\frac{\partial f}{\partial x_2} = \lim_{\Delta x_2 \to 0} \frac{f(x_1, x_2 + \Delta x_2) - f(x_1, x_2)}{\Delta x_2}
  • Second-Order Partial Derivatives:

    • A function of two variables possesses three distinct second-order partial derivatives:
    • Second Own Partial Derivative with respect to x1x_1:       ∂2f∂x12=∂∂x1(∂f∂x1)\frac{\partial^2 f}{\partial x_1^2} = \frac{\partial}{\partial x_1}\left(\frac{\partial f}{\partial x_1}\right)
    • Second Own Partial Derivative with respect to x2x_2:       ∂2f∂x22=∂∂x2(∂f∂x2)\frac{\partial^2 f}{\partial x_2^2} = \frac{\partial}{\partial x_2}\left(\frac{\partial f}{\partial x_2}\right)
    • Cross Partial Derivative:       ∂2f∂x1∂x2=∂∂x1(∂f∂x2)=∂∂x2(∂f∂x1)\frac{\partial^2 f}{\partial x_1 \partial x_2} = \frac{\partial}{\partial x_1}\left(\frac{\partial f}{\partial x_2}\right) = \frac{\partial}{\partial x_2}\left(\frac{\partial f}{\partial x_1}\right)(By Young's Theorem, the order of differentiation does not alter the cross partial result).
  • Example Calculation of Partial Derivatives:

    • Given the function: y=(x1+x2)2y = (\sqrt{x_1} + \sqrt{x_2})^2
    • Expanding the algebraic expression:     y=x1+2⋅x11/2⋅x21/2+x2y = x_1 + 2 \cdot x_1^{1/2} \cdot x_2^{1/2} + x_2
    • Calculating the First-Order Partial Derivative ∂y∂x1\frac{\partial y}{\partial x_1}:
    • Differentiating x1x_1 gives 11.
    • Differentiating 2⋅x11/2⋅x21/22 \cdot x_1^{1/2} \cdot x_2^{1/2} treating x2x_2 as constant: 2⋅(12⋅x1−1/2)⋅x21/2=x1−1/2⋅x21/22 \cdot \left(\frac{1}{2} \cdot x_1^{-1/2}\right) \cdot x_2^{1/2} = x_1^{-1/2} \cdot x_2^{1/2}.
    • Differentiating x2x_2 with respect to x1x_1 gives 0$.\n * Result:\n      \frac{\partial y}{\partial x_1} = 1 + x_1^{-1/2} \cdot x_2^{1/2} = 1 + \sqrt{\frac{x_2}{x_1}}\n * Calculating the First-Order Partial Derivative \frac{\partial y}{\partial x_2}:\n    \frac{\partial y}{\partial x_2} = 1 + x_1^{1/2} \cdot x_2^{-1/2} = 1 + \sqrt{\frac{x_1}{x_2}}\n\n# Unconstrained Optimization with Two Choice Variables\n\n* **Optimization Conditions for Two-Variable Functions**:\n * For a smooth, differentiable function y = f(x_1, x_2), finding a local interior optimum requires evaluating first-order partial derivatives.\n * **First-Order Conditions (FOC)**:\n * Both partial derivatives must simultaneously equal zero:\n      \frac{\partial f}{\partial x_1} = 0\n      \frac{\partial f}{\partial x_2} = 0\n * **Second-Order Conditions (SOC)**:\n * Constructed using a 2 \times 2 matrix of second-order partial derivatives (the Hessian matrix):\n * **Local Interior Maximum**: The 2 \times 2 matrix of second-order partial derivatives must be **negative definite**.\n * **Local Interior Minimum**: The 2 \times 2 matrix of second-order partial derivatives must be **positive definite**.\n\n* **Geometric Intuition for Multi-Variable FOC**:\n * *Hiking Analogy*: Imagine hiking in a three-dimensional terrain with coordinates in North-South (x_1)andEast−West() and East-West (x_2) directions.\n * At the precise peak of a mountain (local maximum) or the bottom of a bowl/basin (local minimum), taking a small step in any direction (North, South, East, West, or diagonal combination) yields zero instantaneous change in elevation.\n * Thus, the slope in all orthogonal directions is flat (\frac{\partial f}{\partial x_1} = 0andand\frac{\partial f}{\partial x_2} = 0).\n\n* **Step-by-Step Numerical Unconstrained Optimization Example**:\n * Objective function to maximize:\n    y = 10 \cdot x_1 - x_1^2 + 20 \cdot x_2 - x_2^2\n * Step 1: Compute FOC with respect to x_1 and set to zero:\n    \frac{\partial y}{\partial x_1} = 10 - 2 \cdot x_1 = 0 \implies 2 \cdot x_1 = 10 \implies x_1^* = 5\n * Step 2: Compute FOC with respect to x_2 and set to zero:\n    \frac{\partial y}{\partial x_2} = 20 - 2 \cdot x_2 = 0 \implies 2 \cdot x_2 = 20 \implies x_2^* = 10\n * *Notation Standard*: An asterisk ()denotesoptimalvalues() denotes optimal values (x_1^, x_2^) or equilibrium quantities.\n * Step 3: Compute the maximized value of the function (y^):\n    y^* = 10(5) - (5)^2 + 20(10) - (10)^2 = 50 - 25 + 200 - 100 = 125\n * Step 4: Verification of SOC:\n * \frac{\partial^2 y}{\partial x_1^2} = -2\n * \frac{\partial^2 y}{\partial x_2^2} = -2\n * \frac{\partial^2 y}{\partial x_1 \partial x_2} = 0\n * Because own partials are negative and cross partials are zero, the matrix is negative definite, confirming y^* = 125 is a unique global maximum.\n\n# Principles and Methods of Constrained Optimization\n\n* **The Nature of Economic Constraints**:\n * In real-world decision-making, choice variables cannot be set to arbitrary values because agents face binding structural or financial constraints.\n * **Standard Problem Setup**:\n    \max_{x_1, x_2} f(x_1, x_2) \quad \text{subject to} \quad g(x_1, x_2) = b\n * f(x_1, x_2): The **objective function** (e.g., utility, revenue, output, or cost).\n * x_1, x_2: The **choice variables** under the decision-maker's direct control.\n * g(x_1, x_2) = b:The∗∗constraintequation∗∗,where: The **constraint equation**, whereb represents a fixed resource limit or exogenous parameter (e.g., total budget, fence length, volume requirement).\n\n* **Three Approaches to Solving Constrained Optimization Problems**:\n 1. **Substitution Method**: Explicitly solve the constraint equation for one variable, substitute it into the objective function, and solve the resulting unconstrained single-variable problem.\n 2. **Graphical Method**: Graph the constraint curve alongside level curves (iso-utility curves, iso-cost curves, or isoquants) of the objective function to identify the point of tangency.\n 3. **Lagrange Multiplier Method**: Convert the constrained problem into an unconstrained problem by introducing a new choice variable (the Lagrange multiplier, \lambda) and formulating a Lagrangian function.\n\n# Substitution and Graphical Methods in Constrained Optimization\n\n* **Detailed Mechanics of the Substitution Method**:\n * Given constraint g(x_1, x_2) = b,isolatevariable, isolate variablex_2toexpressitasafunctionofto express it as a function ofx_1andandb:\n    x_2 = h(x_1, b)\n * Substitute h(x_1, b)intoobjectivefunctioninto objective functionf(x_1, x_2),forminganunconstrainedobjectiveintermsof, forming an unconstrained objective in terms ofx_1 only:\n    \max_{x_1} f(x_1, h(x_1, b))\n * Differentiate with respect to x_1,setequaltozero,solveforoptimal, set equal to zero, solve for optimalx_1^,andback−substitutetofind, and back-substitute to findx_2^.\n\n* **Comprehensive Example: Maximizing Enclosure Area (The Rancher's Problem)**:\n * *Problem Scenario*: A rancher wishes to build a rectangular fence enclosure of maximum area using a fixed parameter length of fencing p\n * *Mathematical Formulation*:\n    \max_{x_1, x_2} (x_1 \cdot x_2) \quad \text{subject to} \quad 2 \cdot x_1 + 2 \cdot x_2 = p\n    where x_1islength,is length,x_2iswidth,andis width, andp is total perimeter length.\n * Step 1: Isolate x_2 in the constraint:\n    2 \cdot x_2 = p - 2 \cdot x_1 \implies x_2 = \frac{p}{2} - x_1\n * Step 2: Substitute x_2 into the objective function:\n    A(x_1) = x_1 \cdot \left(\frac{p}{2} - x_1\right) = \frac{p}{2} \cdot x_1 - x_1^2\n * Step 3: Differentiate \frac{dA}{dx_1} and set to zero:\n    \frac{dA}{dx_1} = \frac{p}{2} - 2 \cdot x_1 = 0 \implies 2 \cdot x_1 = \frac{p}{2} \implies x_1^* = \frac{p}{4}\n * Step 4: Back-substitute to calculate x_2^andmaximumareaand maximum areaA^:\n    x_2^* = \frac{p}{2} - \frac{p}{4} = \frac{p}{4}\n    A^* = x_1^* \cdot x_2^* = \left(\frac{p}{4}\right)\left(\frac{p}{4}\right) = \frac{p^2}{16}\n * *Economic/Geometric Conclusion*: The optimal rectangular shape that maximizes area for a given perimeter is a perfect square where each side equals \frac{p}{4}.\n\n* **Overview of Graphical Methods**:\n * Applicable when problems involve exactly two variables.\n * Step 1: Plot the constraint line or curve g(x_1, x_2) = binin(x_1, x_2) space.\n * Step 2: Plot the **level curves** of the objective function f(x_1, x_2) = c(curvesalongwhichtheobjectivefunctionmaintainsaconstantvalue(curves along which the objective function maintains a constant valuec).\n * Step 3: Identify the point on the constraint line that touches the highest achievable level curve (for maximization) or lowest achievable level curve (for minimization).\n\n# The Lagrange Multiplier Method and Economic Efficiency\n\n* **Historical Context and Formal Construction**:\n * Developed by the French mathematician Joseph-Louis Lagrange.\n * Transforms a constrained optimization problem into an unconstrained optimization problem over an expanded set of variables.\n\n* **Step-by-Step Protocol for the Lagrange Method**:\n * Consider the constrained problem: \max_{x_1, x_2} f(x_1, x_2)subjecttosubject tog(x_1, x_2) = b\n * **Step 1: Rewrite Constraint**: Set constraint equal to zero:\n    b - g(x_1, x_2) = 0\n * **Step 2: Construct the Lagrangian Function (\mathcal{L})**:\n    Define new variable \lambda (the Lagrange multiplier):\n    \mathcal{L}(x_1, x_2, \lambda) = f(x_1, x_2) + \lambda \cdot [b - g(x_1, x_2)]\n * **Step 3: Calculate First-Order Conditions**: Take partial derivatives with respect to x_1,,x_2,and, and\lambda, setting each derivative equal to zero:\n    \frac{\partial \mathcal{L}}{\partial x_1} = \frac{\partial f}{\partial x_1} - \lambda \cdot \frac{\partial g}{\partial x_1} = 0\n    \frac{\partial \mathcal{L}}{\partial x_2} = \frac{\partial f}{\partial x_2} - \lambda \cdot \frac{\partial g}{\partial x_2} = 0\n    \frac{\partial \mathcal{L}}{\partial \lambda} = b - g(x_1, x_2) = 0\n\n* **Economic Interpretation of the First-Order Conditions**:\n * Solving the first two FOC equations for \lambda yields:\n    \lambda = \frac{\frac{\partial f}{\partial x_1}}{\frac{\partial g}{\partial x_1}} = \frac{\frac{\partial f}{\partial x_2}}{\frac{\partial g}{\partial x_2}}\n * **Benefit-Cost Ratio Analysis**:\n * \frac{\partial f}{\partial x_i}representsthe∗∗marginalbenefit∗∗(increaseinobjectivefunctionrepresents the **marginal benefit** (increase in objective functionf)fromaunitincreaseinchoicevariable) from a unit increase in choice variablex_i.\n * \frac{\partial g}{\partial x_i}representsthe∗∗marginalcost∗∗(amountofconstraintresourcerepresents the **marginal cost** (amount of constraint resourcebconsumed)byincreasingchoicevariableconsumed) by increasing choice variablex_i\n * At the optimal solution, the marginal benefit per unit of resource consumed must be strictly equal across all choice variables.\n * **Consumer Application**: For a consumer choosing goods, the marginal satisfaction (marginal utility) derived per dollar spent must be equal across all purchased goods. If spending an extra dollar on clothing yields more satisfaction than an extra dollar on food, utility is not optimized; reallocation of spending toward clothing will strictly increase total well-being.\n\n# Practical Application: Optimal Design and Surface Area Minimization for Cylindrical Containers\n\n* **Problem Statement: Bat City Brewery Can Optimization**:\n * Bat City Brewery produces beer packaged in cylindrical aluminum cans containing standard volume V = 12\,\text{fl oz}.\n * **Conversion Factor**: 1\,\text{fl oz} = 1.805\,\text{cu in}.\n * Target Volume Vincubicinches:in cubic inches:12 \times 1.805 = 21.66\,\text{cu in}.\n * **Goal**: Select cylinder dimensions (radius rofbase,heightof base, heighth)thatminimizetotalaluminumused(surfacearea) that minimize total aluminum used (surface areaS)subjecttoholdingexactly) subject to holding exactly21.66\,\text{cu in} of liquid.\n\n* **Geometric Formulas for a Cylinder**:\n * **Volume Formula**: V = \pi \cdot r^2 \cdot h\n * **Surface Area Formula**: S = 2 \cdot \pi \cdot r^2 + 2 \cdot \pi \cdot r \cdot h\n * 2 \cdot \pi \cdot r^2: Sum of surface areas of the top lid and bottom circular base.\n * 2 \cdot \pi \cdot r \cdot h:Surfaceareaofthewrappedlateralsidetube(circumference: Surface area of the wrapped lateral side tube (circumference2 \cdot \pi \cdot rmultipliedbyheightmultiplied by heighth).\n\n* **Formulation of the Lagrangian**:\n  \mathcal{L}(r, h, \lambda) = 2 \cdot \pi \cdot r^2 + 2 \cdot \pi \cdot r \cdot h + \lambda \cdot [21.66 - \pi \cdot r^2 \cdot h]\n\n* **Derivation of Optimal Dimensions**:\n * **FOC 1: Partial Derivative with respect to r**:\n    \frac{\partial \mathcal{L}}{\partial r} = 4 \cdot \pi \cdot r + 2 \cdot \pi \cdot h - 2 \cdot \lambda \cdot \pi \cdot r \cdot h = 0\n    Solving for \lambda:\n    4 \cdot \pi \cdot r + 2 \cdot \pi \cdot h = 2 \cdot \lambda \cdot \pi \cdot r \cdot h\n    \lambda = \frac{4 \cdot \pi \cdot r + 2 \cdot \pi \cdot h}{2 \cdot \pi \cdot r \cdot h} = \frac{2}{h} + \frac{1}{r}\n\n * **FOC 2: Partial Derivative with respect to h**:\n    \frac{\partial \mathcal{L}}{\partial h} = 2 \cdot \pi \cdot r - \lambda \cdot \pi \cdot r^2 = 0\n    Solving for \lambda:\n    \lambda \cdot \pi \cdot r^2 = 2 \cdot \pi \cdot r \implies \lambda = \frac{2 \cdot \pi \cdot r}{\pi \cdot r^2} = \frac{2}{r}\n\n * **FOC 3: Partial Derivative with respect to \lambda**:\n    \frac{\partial \mathcal{L}}{\partial \lambda} = 21.66 - \pi \cdot r^2 \cdot h = 0 \implies \pi \cdot r^2 \cdot h = 21.66\n\n* **Algebraic Solution for Optimal Shape**:\n * Equating the two expressions for \lambda:\n    \frac{2}{h} + \frac{1}{r} = \frac{2}{r} \implies \frac{2}{h} = \frac{1}{r} \implies h = 2 \cdot r\n * *Geometric Rule*: To minimize surface area for any given volume, a cylinder's height hmuststrictlyequalitsbasediameter(must strictly equal its base diameter (d = 2 \cdot r).\n\n* **Numerical Computation of Optimal Dimensions**:\n * Substitute h = 2 \cdot r into volume constraint:\n    \pi \cdot r^2 \cdot (2 \cdot r) = 21.66 \implies 2 \cdot \pi \cdot r^3 = 21.66\n    r^3 = \frac{21.66}{2 \cdot \pi} = \frac{21.66}{6.28318} \approx 3.4473\n    r^* = \sqrt[3]{3.4473} \approx 1.5\,\text{inches}\n    h^* = 2 \cdot r^* = 2(1.5) = 3.0\,\text{inches}\n\n* **Comparison with Real-World Industry Dimensions**:\n * **Theoretical Cost-Minimizing Can**: Radius r \approx 1.5\,\text{inches},Height, Heighth \approx 3.0\,\text{inches} (A short, squat shape similar to a paint can).\n * **Actual Real-World 12\,\text{fl oz}BeerCan∗∗:RadiusBeer Can**: Radiusr \approx 1.2\,\text{inches},Height, Heighth \approx 4.75\,\text{inches}$$ (Height is roughly double the base diameter).
    • Economic Implication: Real-world commercial breweries do not design cans solely to minimize aluminum material costs. Their actual objective functions incorporate other critical operational factors such as consumer hand-ergonomics, shelf display aesthetics, ease of holding, refrigeration packing efficiency, and manufacturing stackability.