The computational results on problems with up to 2750 variables strongly confirm our hypothesis that a combination of problem preprocessing, cutting planes, and clever branch-and-bound techniques ...

By applying a linear programming approach for the solution of two person-zero sum games with mixed strategies, it is shown that a linear optimization problem with multiple objective functions can be ...