Content deleted Content added
→Overview: the standard form consists in maximizing an objective, not minimizing |
m →Overview: Standard form has equality Ax=b. |
||
Line 19:
::<math>\mathbf{c}^T \cdot \mathbf{x}</math>
:Subject to
::<math>\mathbf{A}\mathbf{x}
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 standard form so this results in no loss of generality.
| |||