= Slack form of a linear program
{title2=$x_B=b-Ax_N,\quad z=v+c^Tx_N$}
An equality representation of a <linear program> in which each <basic variable> and the <objective function> are expressed using <nonbasic variables>, and all variables are nonnegative. Introducing <slack variables> into $Ax\leq b$ gives $s=b-Ax$. Setting the <nonbasic variables> to zero yields its <basic solution>; nonnegative resulting basic values make this a <basic feasible solution>. A <simplex algorithm> pivot exchanges a basic and nonbasic index and rewrites these expressions.
Back to article page
