Solved exercise of Minimization of three variables with artificial in the base with zero value. Big M MethodExample of Linear Programming - Big M Method

Next, the problem will be adapted to the standard linear programming model, adding the slack, excess and/or artificial variables in each of the constraints and converting the inequalities into equalities:

• Constraint 1: It has sign “=” (equal), therefore the artificial variable A₁. This variable will be placed at the base in the initial matrix.
• Constraint 2: It has sign “=” (equal), therefore the artificial variable A₂. This variable will be placed at the base in the initial matrix.
• Constraint 3: It has sign “=” (equal), therefore the artificial variable A₃. This variable will be placed at the base in the initial matrix.

Since the problem has artificial variables, the Big M method will be used. As the problem is a minimization problem, the artificial variables will be added to the objective function multiplied by a very large number (represented by the letter M) in this way the simplex algorithm will penalize and eliminate them from the base.

Now we will show the problem in the standard form. We will place the coefficient 0 (zero) where appropriate to create our initial matrix:

Initial Matrix

We will use the coefficients of the equations to elaborate our first table:

a) Reduced Cost Vector Calculation (Z):

The values recorded in row Z were obtained as follows:

• Z₁ = (C_b,1×X_1,1) + (C_b,2×X_1,2) + (C_b,3×X_1,3) - C_j,1 = (M×1) + (M×-1) + (M×0) - (-1) = 1
• Z₂ = (C_b,1×X_2,1) + (C_b,2×X_2,2) + (C_b,3×X_2,3) - C_j,2 = (M×1) + (M×1) + (M×2) - (2) = 4M − 2
• Z₃ = (C_b,1×X_3,1) + (C_b,2×X_3,2) + (C_b,3×X_3,3) - C_j,3 = (M×1) + (M×2) + (M×3) - (-1) = 6M + 1
• Z₄ = (C_b,1×A_1,1) + (C_b,2×A_1,2) + (C_b,3×A_1,3) - C_j,4 = (M×1) + (M×0) + (M×0) - (M) = 0
• Z₅ = (C_b,1×A_2,1) + (C_b,2×A_2,2) + (C_b,3×A_2,3) - C_j,5 = (M×0) + (M×1) + (M×0) - (M) = 0
• Z₆ = (C_b,1×A_3,1) + (C_b,2×A_3,2) + (C_b,3×A_3,3) - C_j,6 = (M×0) + (M×0) + (M×1) - (M) = 0
• Z₇ = (C_b,1×R₁) + (C_b,2×R₂) + (C_b,3×R₃) = (M×6) + (M×4) + (M×10) = 20M

b) Optimality Condition (Incoming Variable):

In the reduced cost vector (Z) we have positive values, so we must select the highest value for the pivot column (minimization).

In the vector Z (excluding the last value), we have the following numbers: [1, 4M − 2, 6M + 1, 0, 0, 0]. The highest value is = 6M + 1 which corresponds to the X₃ variable. This variable will enter the base and its values in the table will form our pivot column.

Note: To check the chosen value, simply replace the variable M by a large number (e.g. M = 1000000) in the vector of reduced costs.

d) Feasibility Condition (Outgoing Variable):

The feasibility condition will be verified by dividing the values of column R by the pivot column X₃. To process the division, the denominator must be strictly positive (If it's negative or zero, it'll display N/A = Not applicable). The lowest value will define the variable that will exit from the base:

• Row A₁ → R₁ / X_3,1 = 6 / 1 = 6
• Row A₂ → R₂ / X_3,2 = 4 / 2 = 2 (The Lowest Value)
• Row A₃ → R₃ / X_3,3 = 10 / 3 = 3.333

The lowest value corresponds to the A₂ row. This variable will come from the base. The pivot element corresponds to the value that crosses the X₃ column and the A₂ row = 2.