Question: linear programming

I found the below text here :  scienceblogs.com/goodmath/2008/07/back_to_math_solving_zerosum_g.php

My question is how can I set up this problem in Maple ?!

The objective function should be: min(E(H1), E(H2), E(H3))
constraint:  Σp_i=1, and ∀i: 0≤p_i≤1.
solution: p₁=0.57, p₂=0.17, p₃=0.26.

Let's get specific. Here's a game. We'll call the two players H (for the player who picks a strategy that's a horizontal line across the graph), and V. The grid is set up from the viewpoint of player H: the entry in a position is what V needs to pay to H if that pair of strategies is selected:

        V1         V2        V3

H1     3          1           3

H2      2         4           5

H3      3         6            1
 

Then the linear programming problem works out as follows:

• Let E(H1) = 3p₁ + 1p₂ + 3p₃
• Let E(H2) = 2p₁ + 4p₂ + 5p₃
• Let E(H3) = 3p₁ + 6p₂ + 1p₃

Maximize: min(E(H1), E(H2), E(H3)), where Σp_i=1, and ∀i: 0≤p_i≤1.

When we run that through our linear programming tool, we get the following probability assignment
(rounded to two figures): p₁=0.57, p₂=0.17, p₃=0.26.