0

I have the following problem:
$ max_{x,y} \ x + y $
subject to
$ 2x + y \leq 1 $
$ x + 3y \leq 3 $
$ x,y \geq 0 $
How to find the dual of this problem using the Lagrangian?
I have done the following steps:
Step 1: Rewriting the problem as a minimization
$ - \ min_{x,y} \ -x - y $
subjec...