This problem looks like a standart linear-programming problem. But it can be solved with O(n^3) complexity without simplex metod. What the difference between this problem and classical dual game problem in general form?