Simplex Algorithm problem

Jan 2009
4
0
Hi
I have a Simplex Algorithm problem
It must be solved with minimum iterations of simplex algorithm tables.
It can be solved with any technique except Matrix.
Can anyone suggest me a way to achieve this?

Problem:
\(\displaystyle
Min Z=4{X_1}+X_2+4{X_3}+6{X_4}
\)

St:
\(\displaystyle
2{X_1}+4{X_2}\ge10
\)
\(\displaystyle
9{X_2}+3{X_3}\ge18
\)
\(\displaystyle
-5{X_2}+5{X_4}\ge50
\)
\(\displaystyle
X_j\ge0
\)
\(\displaystyle
j=1,2,3,4\)

Thanks