I have a simple maximization problem. $\ 7x_1+9x_2+5x_3 => max$
With following constraints:
$\ 3x_1+ 4x_2+ 1.5x_3 <= 100 $
$\ 19x_1+ 12x_2+13x_3 <= 1000 $
$\ 8x_1+ 10x_2+9x_3 <= 500 $
$\ 2x_1+ 3x_2+1.9x_3 <= 75 $
After applying simplex method I receive following solution.
$\ x_1 = 9.45, x_3 = 47.14, d_2 =203.5, d_4 = -33.42 $
With some rounding involved, so it is a little rough. However when checking the solution it became apparent that condition number 4 has been broken.
I thought that I made some numerical mistake but online solver came up with the same solution.
It appears that for some reason the algorithm came up with optimal answer violating one of the conditions, which I though to be impossible.
So either the simplex does not work like I think it does or I made some mistake when defining the constraints.
Anyway I wonder what exactly happened and if there is a way how to prevent it from happening again.
Edit: $\ x_2$ is supposed to be multiplied by 9 in the problem.