It's easier to maximise A^2 than A. So the problem is to maximise s(s–x)(s–y)(s–z) subject to the constraint x+y+z=2s, where s is constant. (There's also the condition that all the quantities x, y, z, s–x, s–y, s–z should be positive.) That should be a pretty standard Lagrange multiplier problem.