linear programming with $L_p$ norm constraint

162 Views Asked by At

$$\text{minimize } c^Tx$$ $$\text{s.t. } \|x\|_p = 1, x_i \geq 0. $$

How to derive the optimal explicit solution $x^*$? Note that $c$ is a constant vector.