[SOLVED] Linear Programing Problem, Simplex but with a negative constraint?

Hi, I have the following question and I need to know if i have augmented it correctly and what my next steps should be.

Maximise

**subject to**

and

My steps to solve were

let

so then we have:

and

i thought this was the correct augmented form of the LPP, however, none of the multiple choice answers i can choose from show this, hence i know it is wrong, but I'm not sure what i have done wrong, all the answers have added more variables.

Re: Linear Programing Problem, Simplex but with a negative constraint?

I have come up with this as my augmented problem:

However, when i try to solve this in a tableau i don't get any of the answers given.

Am i first supposed to change the first equation so that and coefficients are to equal zero or just some of the variables.

Re: Linear Programing Problem, Simplex but with a negative constraint?