Standard Form Problems

Standard form problems ask you to convert a general LP into the form used by simplex theory.

Target Form

In this course, standard form is usually:

\[\min c^Tx\]

subject to:

\[Ax=b, \qquad x\ge 0.\]

Max to Min

Convert:

\[\max c^Tx\]

into:

\[\min -c^Tx.\]

Less-Than Constraints

For:

\[a^Tx\le b,\]

add a slack variable:

\[a^Tx+s=b, \qquad s\ge 0.\]

Greater-Than Constraints

For:

\[a^Tx\ge b,\]

subtract a surplus variable:

\[a^Tx-s=b, \qquad s\ge 0.\]

Free Variables

For a free variable $x_j$, use:

\[x_j=x_j^+-x_j^-, \qquad x_j^+,x_j^-\ge 0.\]

Negative Variables

If:

\[x_j\le 0,\]

replace it by:

\[x_j=-y_j, \qquad y_j\ge 0.\]

Checklist

A correct standard-form answer has:

  • minimization objective
  • only equality constraints
  • all variables nonnegative
  • all added slack/surplus variables shown
  • objective written in terms of the new variables

See Also

Added drill source

Use Standard Form Drill Set and Standard Form Worked Examples for conversion practice.

Exam checkpoint

Practice under exam timing. Write the full pipeline: model, standard form if needed, BFS/reduced costs if asked, simplex iterations if asked, final objective value and interpretation.