As a special favour to you, here is a link to my foolproof instructions for solving linear programming problems by the simplex method. You can find them at http://www.maths.leeds.ac.uk/~pmt6ecl/simplex.pdf. Download that pdf file and follow the instructions there.

To get you started, notice that your problem here is in what I call nonstandard form. So you need to start by following the procedure on page 2 of the pdf file. For a start, the objective function is to be minimised. So you should replace it by its negative, , which you maximise (and the answer to the problem will then be the negative of that).

Next, some of the inequalities have a instead of a . Change the sign of everything in them so as to flip the inequality sign. That gives you the set of inequalities

together with the objective equation

The matrix for the initial simplex tableau is then

(Some people leave out the last-but-one column in the tableau, which does not play an essential part in the reduction process.)

You now have to follow the reduction process described in Steps B2, B3 and B4 on the second page of the pdf file, and then you can read off the solution to the problem.

If you are unsure about how to operate the pivoting procedure, there are some good worked examples here.