This is more about what I have to do than about how to do it.
I have the following maximization problem:
$$ \begin{array}{ll} \text{maximize}&q_1+q_2\\ \text{subject to}& x_{11}q_1^\beta+x_{21}q_2^\beta\leq k_1\\ & x_{12}q_1^\beta+x_{22}q_2^\beta\leq k_2\\ & q_1\geq 0\\ & q_2\geq 0\\ \end{array} $$ where $x_{11},x_{22},k_1,k_2\geq0$, $x_{12},x_{21}>0$ and $\beta>1$.
Under these conditions, the slope of the constraints can be shown to be strictly decreasing from $0$ to $-\infty$. I know that there are different types of solutions to this problem depending on the values of $k_1$ and $k_2$.
- Do I need to prove that at least one of the two first constraints is binding or is it enough to note that the feasible set is compact?
- When just one of the constraints is binding, do I need to prove that the slope of that constraint at the optimum is $-1$?
- When both constraints are binding, two situations can arise (with respect to the slope of the constraints at the optimum): either one of the slopes is $-1$ and the other is different from $-1$ or one is larger and the other smaller than $-1$. Does any this need to shown or is it enough to enunciate it?
- Can I argue that if the optimum is such that the slopes of the constraints are different from $-1$ then both constraints need to be binding?