In[1]:= s = 95; u = 0.1; x = 100; k = 0.01;
Subscript[c, A] = (Subscript[p, A]*(s*(1 + u) - x)) + k;
Subscript[c, B] = (Subscript[p, B]*(s*(1 + u) - x)) - k;
Subscript[Z, A] = (1-(v-Subscript[c,A])/(Subscript[c,B]-Subscript[c,A]))^\[Beta](v-Subscript[c,A]);
Subscript[Z, B] = (1-(v-Subscript[c,B])/(Subscript[c,B]-Subscript[c,A]))^\[Alpha](Subscript[c,B]-v);
Maximize[{Norm[Subscript[Z,A]]+Norm[Subscript[Z,B]], Subscript[c,A]<=v<=Subscript[c,B] &&
0<=Subscript[p,A]<=1 && 0<=Subscript[p,B]<= 1}, {v, \[Alpha], \[Beta], Subscript[p,A], Subscript[p,B]}]
During evaluation of In[1]:=NMaximize::cvdiv:Failed to converge to a solution. The function may be unbounded.
Out[9]= {3.97046*10^15, {v -> 0.101697, \[Alpha] -> 53.8285, \[Beta] -> -34.2923, Subscript[p, A] -> 0.0203771,
Subscript[p, B] -> 0.0799841}}
You may want to look at the values of each part of ZA and ZB to determine whether more constraints are needed or whether there is something about the way that I have done this which is incorrect.