Solve the following Linear Program problem using the simplex

Solve the following Linear Program problem using the simplex method. In order to get full credit you have to show all your work. Max x + y Constrains: 2x + y - 3z lessthanorequalto 40 x + 2y + 3z lessthanorequalto 32 x + z lessthanorequalto 25 x greaterthanorequalto 0, y greaterthanorequalto 0, z greaterthanorequalto 0

Solution

Ans-

Consider the following steps:

A change is made to the variable naming, establishing the following correspondences:

As the independent terms of all restrictions are positive no further action is required. Otherwise there would be multiplied by \"-1\" on both sides of the inequality (noting that this operation also affects the type of restriction).

The inequalities become equations by adding slack, surplus and artificial variables as the following table:

In this case, a slack variable (X3, X4 and X5) is introduced in each of the restrictions of type, to convert them into equalities, resulting the system of linear equations:

Z - 3·X1 - X2 - 0·X3 - 0·X4 - 0·X5 = 0

The initial tableau of Simplex method consists of all the coefficients of the decision variables of the original problem and the slack, surplus and artificial variables added in second step (in columns, with P0 as the constant term and Pi as the coefficients of the rest of Xi variables), and constraints (in rows). The Cb column contains the coefficients of the variables that are in the base.

The first row consists of the objective function coefficients, while the last row contains the objective function value and reduced costs Zj - Cj.

The last row is calculated as follows: Zj = (Cbi·Pj) for i = 1..m, where if j = 0, P0 = bi and C0 = 0, else Pj = aij. Although this is the first tableau of the Simplex method and all Cb are null, so the calculation can simplified, and by this time Zj = -Cj.

If the objective is to maximize, when in the last row (indicator row) there is no negative value between discounted costs (P1 columns below) the stop condition is reached.

In that case, the algorithm reaches the end as there is no improvement possibility. The Z value (P0 column) is the optimal solution of the problem.

Another possible scenario is all values are negative or zero in the input variable column of the base. This indicates that the problem is not limited and the solution will always be improved.

Otherwise, the following steps are executed iteratively.

First, input base variable is determined. For this, column whose value in Z row is the lesser of all the negatives is chosen. In this example it would be the variable X1 (P1) with -3 as coefficient.

If there are two or more equal coefficients satisfying the above condition (case of tie), then choice the basic variable.

The column of the input base variable is called pivot column (in green color).

Once obtained the input base variable, the output base variable is determined. The decision is based on a simple calculation: divide each independent term (P0 column) between the corresponding value in the pivot column, if both values are strictly positive (greater than zero). The row whose result is minimum score is chosen.

If there is any value less than or equal to zero, this quotient will not be performed. If all values of the pivot column satisfy this condition, the stop condition will be reached and the problem has an unbounded solution (see Simplex method theory).

In this example: 18/2 [=9] , 42/2 [=21] and 24/3 [=8]

The term of the pivot column which led to the lesser positive quotient in the previous division indicates the row of the slack variable leaving the base. In this example, it is X5 (P5), with 3 as coefficient. This row is called pivot row (in green).

Maximize	Z = f(x,y) = 3x + 2y
subject to:	2x + y 18
	2x + 3y 42
	3x + y 24
	x 0 , y 0