The proposed vectors are nonnegative, and direct multiplication gives
Thus and , proving primal and dual feasibility.
Both objectives equal : and . Weak duality bounds the value of every primal feasible point above by every dual feasible objective. Equality for this feasible pair therefore proves both are optimal, without needing to solve either problem further.
Normalize each optimal vector by its sum . Player I's row strategy and Player II's column strategy are respectively
As a direct check and , so Player II guarantees a loss of at most four and Player I guarantees a gain of at least four.

Articles by others on the same topic (0)

There are currently no matching articles.