Using the dual simplex method on the below problem gives an initial non maximised objective function in the dual (ie dual not feasable):

How can you make the dual feasable in this problem so you can proceed with the dual simplex method.

Max; z=3x_1 + x_2

subject to:

x_1 - x_2 <= -1

-x_1 - x_2 <= -3

2x_1 + x_2 <= 6