Back

Standard form

Let ARm×n, bRm, and cRn. Let x=[x1xn] be a tuple of variables. We focus on LP problems in standard (equality) form: mincTx(P)     s.t.Ax=bx0.

The standard form is often the preferred form to use when studying linear programming because, as we will soon see, it simplifies the discussion of certain ideas, especially those related to computations. It is also prevalent in the research literature on linear programming.

We can convert any given minimization LP problem to an equivalent one in standard form using one of the following transformations:

It is not difficult to check that each of the above transformations results in an equivalent LP problem in the sense that every feasible solution to the transformed problem can be converted to a feasible solution to the original LP problem with the same objective function value and vice versa. Furthermore, the transformed problem has an optimal solution if and only if the original problem does.

Example

We convert the following into an equivalent LP problem in standard form: min3x+2ys.t.x+3y67xy4x0yfree.

First, we replace x with x and y with y+y, y+,y0 to obtain min3x+2y+2ys.t.x+3y+3y67xy++y4x,y+,y0.

Finally, we introduce a slack variable s to the first inequality and a surplus variable t to the second inequality to obtain: min3x+2y+2ys.t.x+3y+3y+s=67xy++yt=4x,y+,y,s,t0.