Mathematical Economics, Minimization

dracolnyte
Messages
28
Reaction score
0

Homework Statement


Consider the following general form of a constant elasticity of substitution production function:

y = [SLp + (1 - S)Kp]1/p

Assume a firm is trying to minimize the cost of producing any given y. Cost are given by

C = wL + rK

Find the firm's cost minimizing demand function for L. The cost minimizing demand for K is determined simultaneously, so you need both first order conditions. You may assume that nonneggativity constraints on L and K are not binding.

The Attempt at a Solution


Is y = [SLp + (1 - S)Kp]1/p expandable?
 
Physics news on Phys.org
Not in any pleasant fashion. Why would you want to expand it?
 
because my prof said it would be easier if we let a1 = S1/p and a2 = (1-S)1/p and leave our answers in terms of a1 and a2
 
im guessing i can make a1p = S and a2p = (1 - S)
then i would get

y = [a1pLp + a2pKp]1/p

y = [(a1L)p + (a2K)p]1/p
 
dracolnyte said:
im guessing i can make a1p = S and a2p = (1 - S)
then i would get

y = [a1pLp + a2pKp]1/p

y = [(a1L)p + (a2K)p]1/p
This is certainly correct.

FYI, I don't think this change of variable has anything to do with how to go about performing this calculation -- it's just a little optional detail that may (or may not) make it less tedious.
 
Seems pretty standard. You want to minimize wL + rK over L and K, with y - [SLp + (1 - S)Kp]^1/p = 0 as your constraint. Define the lagrangian and derive the first order conditions by differentiating the lagrangian with respect to L, K, and lambda.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top