 The simplex algorithm operates on linear programs in the canonical form

with formula_4 the coefficients of the objective function, formula_5 is the matrix transpose, and formula_6 are the variables of the problem, formula_7 is a "p×n" matrix, and formula_8 are nonnegative constants (formula_9).There is a straightforward process to convert any linear program into one in standard form, so using this form of linear programs results in no loss of generality.In geometric terms, the feasible region defined by all values of formula_10 such that formula_11 and formula_12 is a (possibly unbounded) convex polytope.