Simplex algorithm : can't do it !
I feel terribly dumb, but I just can't do this...
Objective function :
Constraints under the canonic form (I'm probably wrong here) :
Let's rewrite using x3, x4, x5 as basic variables :
x1 "goes basic", let's test non-negativity :
Error ! x1 has to be <= -3 AND >= 0 !
What did I do wrong ?
I had my constraints checked with an instructor and he said they were right.
Please note, this problem with only work when minimizing. It won't when maximizing because it is unbounb on a certain side. I would like to join a picture, but right now, I can't.
Thanks for your help !