0
$\begingroup$

I have to maximize $U(x,y)= Min(ax+y, by+x)$ s.a $p_{1}x +p_{2}y =m$. I try the traditional solution for a leontieff $(ax_{1}+y= by_{1}+x)$ function but I'm not sure.. beacause exist regions where one plan is under the other and only one of them is a minimun...

$\endgroup$
  • $\begingroup$ So $ax_1$ and $by_1$ are constants ? $\endgroup$ – callculus May 2 '16 at 16:55
  • $\begingroup$ only $a$ and $b$ $\endgroup$ – Manuel Alejandro Rodriguez May 2 '16 at 20:09
0
$\begingroup$

I do not think an analytical solution exists for the problem.

For a numerical solution, you can use the simplex algorithm to solve the problem, once you have linearized it as follows: $$ \mbox{Maximize }\; Z= t $$ subject to $$ ax+y\ge t\\ by+x\ge t\\ p_1x+p_2y=m $$

$\endgroup$
0
$\begingroup$

It seems if you solve the system of equations [ p1x+p2y=m; ax+y=by+x] you get exactly the solution.

$\endgroup$
  • $\begingroup$ A full answer would do what you've suggested... $\endgroup$ – The Count Jan 19 '17 at 2:23

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.