Given a matrix A$A$, each element A_i,j >= 0$A_{i,j} \geq 0$, find the vector x$\vec x$ that maximizes the minimum element in b $\vec b$ (b = Ax$\vec b = A \vec x$). Note that this is not a linear equation system as I don't know b$\vec b$.
Extra contraints on the solution are x >= 0$x_i \geq 0$, and sum(x) = 1$\sum x_i = 1$.
Is this possible to solve, and if so, how? Can it have 0 or more than one solution?
