Method
Constraints are made to have non-negative right-hand sides and turned into equalities with slack and surplus variables. Artificial variables, penalised by a large constant (Big-M), supply the starting basis, and the simplex method pivots with Bland’s rule until no reduced cost is positive. A positive artificial variable at the end means the problem is infeasible; an entering column with no positive entry means it is unbounded. For two variables the feasible lines and the optimal objective line are drawn.
Computed in your browser with double-precision arithmetic; nothing is sent to a server. Check results by substituting them back.