🔬 Tutorial problems theta \(\theta\)#
Note
This problems are designed to help you practice the concepts covered in the lectures. Not all problems may be covered in the tutorial, those left out are for additional practice on your own.
\(\theta\).1#
Consider the maximization problem
subject to \(c_1 \geq 0\), \(c_2 \geq 0\) and \(p_1 c_1 + p_2 c_2 \leq m\). Here \(p_1, p_2\) and \(m\) are nonnegative constants, and \(\beta \in (0, 1)\).
Show that this problem has a solution if and only if \(p_1\) and \(p_2\) are both strictly positive.
Solve the problem by substitution and using the tangency (relative slope) condition. Discuss, which solution approach is easier.
To answer the first part of the question, review facts of existence of optima.
\(\theta\).2#
Solve the following constrained maximization problem using the Lagrange method, including the second order conditions.
Follow standard algorithm of Lagrange method.
\(\theta\).3#
Find the maxima and minima of the function
Check both first and second order conditions.
Follow standard algorithm of Lagrange method.
\(\theta\).4#
Find the maxima and minima of the function
subject to
where \(a>0\).
Follow standard algorithm of Lagrange method.
\(\theta\).5#
Solve the following maximization problem treating the last constraint as binding
Follow standard algorithm of Lagrange method realizing that the inequality constraints have to be satisfied with equality.