Simplex algorithm: Difference between revisions

Revision as of 17:09, 29 June 2015

Revision as of 17:12, 29 June 2015

Line 21:

::<math>\mathbf{A}\mathbf{x} = \mathbf{b},\, x_i \ge 0</math>

with <math>x = (x_1,\, \dots,\, x_n)</math> the variables of the problem, <math>c = (c_1,\, \dots,\, c_n)</math> are the coefficients of the objective function ''A'', a ''p×n'' matrix, and <math>b = (b_1,\, \dots,\, b_p)</math> constants with <math>b_j\geq 0</math>. There is a straightforward process to convert any linear program into one in standardcanonical form so this results in no loss of generality.

In geometric terms, the [[feasible region]]