Given a matrix A, each element A_i,j >= 0, find the vector x that maximizes the minimum element in b (b = Ax). Note that this is not a linear equation system as I don't know b.

Extra contraints on the solution are x >= 0, and sum(x) = 1.

Is this possible to solve, and if so, how? Can it have 0 or more than one solution?