Standard maximum form of a linear program ($\max \{c^{T}x:Ax\le b,x\ge 0\}$)

This convention for standard maximum form of a linear program requires a maximizing linear function, upper-bound linear inequalities, and nonnegative variables. An unrestricted variable becomes the difference of two nonnegative variables; a lower-bound inequality changes sign. The corresponding dual linear program is $\min \{b^{T}y:A^{T}y\ge c,y\ge 0\}$. Adding nonnegative slack variables instead gives the equivalent equality-constraint standard form. Since standard-form terminology varies, state the chosen convention.