The problem to be solved is:

Maximize	x1 + 2x2 + 3x3
subject to	-x1 + x2 + x3 20  x1 - 3x2 + x3 30
with these bounds	0 x1 40  0 x2 +  0 x3 +