# Operations Research/The Simplex Method

We can solve two variables LP models easily using the graphical method outlined in the previous section but what should we do in case of three variable problems, i.e. when our company makes three products we have to make decisions about. What about four or five variable problems? This is where the simplex method comes in. It is an iterative method which by repeated use gives us the solution to any n variable LP model.when is the unbounded solution

## Standard form of a LP model[edit | edit source]

Let us define an LP model as being in standard form if it satisfies the following two conditions:

- All the constraints with the exception of the non-negativity restrictions are equations with non-negative right hand side.

- All the variables are non-negative.

For example,

- Maximize

- subject to,

- ,

- ,

- ,

- ,

is an LP model in standard form. Note that the usual signs have been equivalently replaced by both variables (s as in **s**lack) and the sign.

How do we convert a given model into a standard model while retaining its sense? This is done as follows:

- If there is a constraint of the type then the right hand side usually represents some limit on the resource (for example the amount of the raw material available) and the left hand side the usage of that resource (i.e. how much raw material is actually used) and so their difference represents the
*slack*or unused amount of the resource. So to convert into an equality we must add a variable representing the slack amount on the left hand side. This variable is known as the*slack variable*and is obviously also non-negative. If we represent it by our constraint is converted into the equation . A similar thing is done in case of a constraint of the type . Here the left hand side has a*surplus*or extra amount then the right hand side and so a non-negative*surplus variable*say must be subtracted to get the equation .

- If the given variable is given to be non-positive then its negative is obviously non-negative and can be substituted in the problem. The real problem comes in the case when the variable is allowed to take on any sign. Then it is called an
*unrestricted variable*. This is overcome by using the substitution where are both non-negative. Intuitively if the variable is positive then is positive and is zero, while if the variable is negative then is zero and is positive. If is zero then obviously are both zero.

A point to note is that the objective function in the original LP model and the standard model is the same.

## Algebraic solution of a LP[edit | edit source]

Let us now try to analyze a LP model algebraically. A solution of the standard LP model will be a solution for the original model (since the slack and surplus variables once removed would make the equations regain their old imbalance) and due to a similar reasoning a solution for the original model will also correspond to a solution for the standard model. Since the objective function is the same for both models so an optimal solution for the standard model will be optimal for the original model as well. Therefore we need to bother only about the standard model.

Now what are the candidates for the optimal solution? They are the solutions of the equality constraints. All we need to do is to find out the solutions and check which of those give the optimal value when put in the objective function. Now usually in the LP model the number of constraints, say m, is outnumbered by the number of variables, say n, and so there are infinitely many solutions to the system of constraints. We can't possibly examine the complete set of infinite solutions. However due to a mathematical result our work is shortened. The result is that if out of the n variables, n-m variables are put to zero, and then if the constraint system can be solved then the solution will correspond to a corner point in the n-space. Such a solution is called a *basic solution (Initial Solution)*. If in addition to being basic it happens to be feasible to the original problem, then it is called a *basic feasible solution* (often abbreviated as BFS). Since the optimal solution is obtained on a corner point (as we observed graphically) so all we need to do is to examine all the basic feasible solutions (which are at most in number, reflective of the number of ways n-m variables can be chosen among the total n to be zero) and then decide which one gives the maximum value for the objective function.

Let us consider an example:

Consider the following LP model:

Maximize z =

subject to,

,

,

.

We first convert it into standard form:

Maximize z =

subject to,

,

,

.

The constraint system has m=2 constraints and n=4 variables. Thus we need to set 4-2=2 variables equal to zero to get a basic solution. For example putting and we get a solution and . This is also clearly feasible and so is a basic feasible solution. The variables being put to zero, that are are called *nonbasic variables* and are called *basic variables*. The *objective value* (the value that is obtained by putting the solution in the objective function) that these solutions (both basic and non basic) give on substitution in the objective function is zero.

The following table summarizes all the basic solutions to the problem:

Nonbasic variables | Basic variables | Basic solution | Feasible | Objective value |
---|---|---|---|---|

(4,5) | Yes | 0 | ||

(4,-3) | No | - | ||

(2.5,1.5) | Yes | 7.5 | ||

(2,3) | Yes | 4 | ||

(5,-6) | No | - | ||

(1,2) | Yes | 8 |

Note that we have not bothered to calculate the objective value for infeasible solutions. The optimal solution is the one which yields the highest objective value i.e. . Hence we have solved the LP model algebraically.

This procedure of solving LP models works for any number of variables but is very difficult to employ when there are a large number of constraints and variables. For example, for m = 10 and n = 20 it is necessary to solve sets of equations, which is clearly a staggering task. With the simplex method, you need only solve a few of these sets of equations, concentrating on those which give improving objective values.

## The Simplex method[edit | edit source]

The method in a nutshell is this. You start with a basic feasible solution of an LP in standard form (usually the one where all the slack variables are equal to the corresponding right hand sides and all other variables are zero) and replace one basic variable with one which is currently non-basic to get a new basic solution (since n-m variables remain zero). This is done in a fashion which ensures that the new basic solution is feasible and its objective value is at least as much as that of the previous BFS. This is repeated until it is clear that the current BFS can't be improved for a better objective value. In this way the optimal solution is achieved.

It is clear that one factor is crucial to the method: which variable should replace which. The variable which is replaced is called the *leaving variable* and the variable which replaces it is known as the *entering variable*. The design of the simplex method is such so that the process of choosing these two variables allows two things to happen. Firstly, the new objective value is an improvement(or at least equals) on the current one and secondly the new solution is feasible.

Let us now explain the method through an example. Consider our old chemical company problem in standard form:

Maximize z =

subject to,

,

,

,

,

.

Now an immediate BFS is obtained by putting all the equal to zero. (Clearly the solution thus obtained will be feasible to the original problem as the right hand sides are all non-negative which is precisely our solution.) If we consider our objective function z = then it is evident that an increase in or will increase our objective value. (Note that currently both are zero being non-basic). A unit increase in will give a 5-fold increase in the objective value while a unit increase in will give a 4-fold increase. It is logical that we elect to make the entering variable in the next iteration.

In the tabular form of the simplex method the objective function is usually represented as . Also the table contains the system of constraints along with the BFS that is obtained. Only the coefficients are written as is usual when handling linear systems.

Basic | z | BFS | ||||||
---|---|---|---|---|---|---|---|---|

z | 1 | -5 | -4 | 0 | 0 | 0 | 0 | 0 |

0 | 6 | 4 | 1 | 0 | 0 | 0 | 24 | |

0 | 1 | 2 | 0 | 1 | 0 | 0 | 6 | |

0 | -1 | 1 | 0 | 0 | 1 | 0 | 1 | |

0 | 0 | 1 | 0 | 0 | 0 | 1 | 2 |

Now for the next iteration we have to decide the entering and the leaving variables. The entering variable is as we discussed. In fact, due to our realignment of the objective function, the most negative value in the z-row of the simplex table will always be the entering variable for the next iteration. This is known as the *optimality condition*. What about the leaving variable? We have to account for the fact that our next basic solution is feasible. So our leaving variable must be chosen with this thought in mind.

To decide the leaving variable we apply what is sometimes called as the *feasibility condition*. That is as follows: we compute the quotient of the solution coordinates (that are 24, 6, 1 and 2) with the constraint coefficients of the entering variable (that are 6, 1, -1 and 0). The following ratios are obtained: 24/6 = 4, 6/1 = 6, 1/-1 = -1 and 2/0 = undefined. Ignoring the negative and the undefined ratio we now proceed to select the minimum of the other two ratios which is 4, obtained from dividing 24(the value of ) by 6. Since the minimum involved the division by 's current value we take the leaving variable as .

What is the justification behind this procedure? It is this. The minimum ratios actually represent the intercepts made by the constraints on the axis. To see this look at the following graph:

Since currently all are 0 we are considering the BFS corresponding to the origin. Now, in the next iteration according to the simplex method we should get a new BFS i.e move to a new corner point on the graph. We can induce an increase in the value of only one variable at a time by making it an entering variable, and since is our entering variable our plan is to increase the value of . From the graph we can see that the value of must be increased to 4 at the point (4,0), which is the smallest non-negative intercept with the axis. An increase beyond that point is infeasible. Also at (4,0) the slack variable assumes a zero value as the first constraint is satisfied as an equality there and so becomes the leaving variable.

Now the problem is to determine the new solution. Although any procedure of solving a linear system can be applied at this stage, usually *Gauss Jordan elimination* is applied. It is based on a result in linear algebra that the elementary row transformations on a system [A|b] to [H|c] do not alter the solutions of the system. According to it the columns corresponding to the basic-variables in the table are given the shape of an identity matrix. (Readers familiar with linear algebra will recognize that it means that the matrix formed with the basis variable columns is transformed into reduced row echelon form.) The solution can then be simply read off from the right most solution column (as n-m of the variables are put to zero and the rest including z have coefficient 1 in one constraint each). Since z is also a variable it's row is treated as one among the constraints comprising the linear system.

The entering variable column is called the *pivot column* and the leaving variable row is called the *pivot row*. The intersection of the pivot column and the leaving variable column is called the *pivot element*. In our example the second row (of ) is the pivot row and the second column(of ) is the pivot column.

The computations needed to produce the new basic solution are:

- Replace the leaving variable in the 'Basic' column with the entering variable.
- New pivot row = Current pivot row ÷ Pivot element

For other rows, including the z row:

- New row = Current row - (Its pivot column coefficient)×(New pivot row)

In our case the computations proceed as follows:

- Replace in the 'Basic' column with
- New pivot row = Current row ÷ 6 =
- New z row = Current z row - (-5)×New row =
- New row = Current row - (1)×New row =
- New row = Current row - (-1)×New row =
- New row = Current row - (0)×New row =

Thus our new table is:

Basic | z | BFS | ||||||
---|---|---|---|---|---|---|---|---|

z | 1 | 0 | 0 | 0 | 0 | 20 | ||

0 | 1 | 0 | 0 | 0 | 4 | |||

0 | 0 | 1 | 0 | 0 | 2 | |||

0 | 0 | 0 | 1 | 0 | 5 | |||

0 | 0 | 1 | 0 | 0 | 0 | 1 | 2 |

The optimality condition now shows that is the entering variable. The feasiblity condition produces the ratios: 4/(2/3) = 6, 2/(4/3) = 1.5, 5/(5/3) = 3 and 2/1 = 2 of which the minimum is 1.5 produced by dividing the coefficient in the row (i.e. the row in which the basic variable has coefficient 1). So becomes the leaving variable. The Gauss Jordan elimination process is applied again to get the following table:

Basic | z | BFS | ||||||
---|---|---|---|---|---|---|---|---|

z | 1 | 0 | 0 | 0 | 0 | 21 | ||

0 | 1 | 0 | 0 | 0 | 3 | |||

0 | 0 | 1 | 0 | 0 | ||||

0 | 0 | 0 | 1 | 0 | ||||

0 | 0 | 0 | 0 | 1 |

Based on the optimality condition none of the z-row coefficients associated with the non-basic variables and are negative. Hence the last table is optimal. The optimal solution can thus be read off as and and the optimal value as z = 21. Obviously the variables and are zero. Our original problem involving only and also clearly has the same solution (just disregard the slacks).

We have dealt with a maximization problem. If the minimization case, since min z = max (-z) (if z is a linear function, which it is) so we can either convert the problem into a maximization one or reverse the optimality condition. Instead of selecting the entering variable as the one with the most negative coefficient in the z row we can select the one with the most positive coefficient. The rest of the steps are the same.

Online tool to solve problems via Simplex method

## Exercise Problem:[edit | edit source]

1. A company involved in the assembly and distribution of printers is concerned with two types – laser and inkjet. Assembly of each laser printer takes two hours, while each inkjet printer takes one hour to assemble, and the staff can provide a total of 40 person-hours of assembly time per day. In addition, warehouse space must be available for the assembly and distribution of the printers, 1 square meter for each laser printer and 3 square meters for each inkjet printer; the company has a total of 45 square meters of storage space available for assembled printers each day. Laser printers can be sold for a profit of €30 per unit and inkjet printers earn a profit of €25 each, but the market in which the company is operating can absorb a maximum of 12 laser printers per day. (There is no such limitation on the market for inkjet printers). Formulate this as a linear programming problem and determine, using the simplex method, the number of each type of printer the company should assemble and distribute in order to maximize daily profit.

Maximize

subject to,

,

,

Solution using PHPSimplex (see link for solution step by step): the optimal solution value is = 635 with = 12 and = 11

## Artificial Starting Solution[edit | edit source]

In the previous problem we had a convenient initial basic feasible solution to apply the simplex method which comprised of the slack variables. If the problem however includes surplus variables the solution obtained by putting all the zero will be basic but not feasible (Why?). In that case instead of arbitrarily searching for an initial basic feasible solution, variables known as *artificial variables* are used. They play the role of slacks in the first iteration and being external to the problem are disposed of (by being driven to zero) at a later iteration. We will discuss a method known as the *two-phase method* which is usually used to handle artificial variable problems.

Let us consider the following problem:

Minimize z =

subject to,

,

,

,

.

Now after converting the problem into standard form we have:

Minimize z =

subject to,

,

,

,

.

Now the first and second constraints do not have any slack variable associated with them. This means that we don't have a convenient initial basic feasible solution available with us. Thus we must introduce artificial variables in the problem to get an initial BFS.

,

,

.

What exactly is the two-phase method? As the name suggests, it consists of two phases: In the first phase we start with an initial basic feasible solution (obtained using the slack and the artificial variables equal to the right hand side and other variables equal to zero) and work to eliminate the artificial variables. To do this we must minimize the sum of the artificial variables. So we change our objective function to Minimize . Hence our problem becomes:

Minimize

subject to,

,

,

.

.

Our initial BFS is of course obtained by putting all the original variables and the surplus variable equal to zero. A problem though crops up at this point. The z row in the simplex method is given by and so the whole system in matrix form is:

Clearly if we put the surplus and the original variables to zero the solution to the system will not be the convenient right hand side because the first row has non zero coefficients of and in it. To be more precise write the above system in the following form: .

Now putting the variables to be zero our solution changes to:

.

or in the form:

Now this is not in reduced row echelon form and therefore the right hand side does not directly provide the basic feasible solution. In the simplex table the last column should contain the solution. Therefore before we can start the simplex method some modification is necessary in the first row so that the system gets the reduced row echelon form. The obvious required elementary transformation is:

New z row = Old z row (i.e. ) + (1× row + 1×)

Now the first equation becomes and on putting the requisite variables to zero we find that the right hand side provides a convenient initial BFS.

Basic | BFS | ||||||
---|---|---|---|---|---|---|---|

z | 7 | 4 | -1 | 0 | 0 | 0 | 9 |

3 | 1 | 0 | 1 | 0 | 0 | 3 | |

4 | 3 | -1 | 0 | 1 | 0 | 6 | |

1 | 2 | 0 | 0 | 0 | 1 | 4 |

Note that we have not bothered to write the column of z in the above table. This is because the nature of the elementary row transformations is such that the z column will always be of the form and so that column can be assumed in every iteration.

The simplex method is now applied to get the solution . The final table obtained will be:

Basic | BFS | ||||||
---|---|---|---|---|---|---|---|

z | 0 | 0 | 0 | -1 | -1 | 0 | 0 |

1 | 0 | 0 | |||||

0 | 1 | 0 | |||||

0 | 0 | 1 | 1 | -1 | 1 | 1 |

Since the artificial variables are zero so we have reached the end of phase 1. If the value of objective function at the end of stage one is not zero, it means that the artificial variables can not be eliminated, meaning the problem is infeasible.

Phase 2 involves using the basic feasible solution currently available as a starting basic feasible solution for the original problem. The objective function is therefore changed and the z-row is made to reflect that. Since the artificial variables have completed their mission of providing us with an initial BFS they should never be made the entering variables now. In fact, they can be totally eliminated from the problem. So our original problem can now be restated as:

Minimize z =

subject to,

,

,

,

.

The table can now be written as:

Basic | BFS | ||||
---|---|---|---|---|---|

z | -4 | -1 | 0 | 0 | 0 |

1 | 0 | 0 | |||

0 | 1 | 0 | |||

0 | 0 | 1 | 1 | 1 |

A similar problem which cropped up in the beginning of phase 1 is now evident. Since the basic variables and have nonzero coefficients in the z-row, the system is not in reduced row echelon form. So we must first apply an elementary row transformation to make these coefficients zero. The evident row transformation is:

New z row = Old z row + (4× row + 1×)

The table thus becomes:

Basic | BFS | ||||
---|---|---|---|---|---|

z | 0 | 0 | 0 | ||

1 | 0 | 0 | |||

0 | 1 | 0 | |||

0 | 0 | 1 | 1 | 1 |

Now the simplex method can be applied. The final solution is: .