# Game theory — Linear programming problem

$minimise \sum_{i=1}^{m} x_{i} = \frac{1}{v} subject to \sum_{i=1}^{m}a_{ij} x_{i} \geq 1$
• How do I get $p* = v(A^{T})^{-1}u$ – italy Jan 2 '18 at 23:18