Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
2K views

LP Using Simplex Method (Minimization Process)

The steps for solving a linear programming minimization problem using the simplex method are similar to maximization, except that: 1) The initial Cj column includes coefficients of artificial and slack variables with positive coefficients 2) The most negative entry is sought in the Cj - Zj row for the optimum column 3) The final optimum table has non-negative entries in the Cj - Zj row Artificial variables are used to create an initial feasible solution but do not appear in the final solution. They have a very high cost assigned to ensure this. Slack and surplus variables have zero cost.

Uploaded by

HERNANDO REYES
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2K views

LP Using Simplex Method (Minimization Process)

The steps for solving a linear programming minimization problem using the simplex method are similar to maximization, except that: 1) The initial Cj column includes coefficients of artificial and slack variables with positive coefficients 2) The most negative entry is sought in the Cj - Zj row for the optimum column 3) The final optimum table has non-negative entries in the Cj - Zj row Artificial variables are used to create an initial feasible solution but do not appear in the final solution. They have a very high cost assigned to ensure this. Slack and surplus variables have zero cost.

Uploaded by

HERNANDO REYES
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

Solving Linear Programming Using Simplex

Method
(Minimization Problems)
Steps of Minimization Process
The steps in solving a minimization problem are similar
to maximization except for 3 processes:
1. The Cj column of the initial table begins with the
coefficient of the artificial variables and the slack
variables with positive coefficient in the
constraints.
2. Instead of looking for the most positive quantity in
the Cj – Zj row for the optimum column, look for
the most negative entry.
3. The optimum table or the final table has
entries in the Cj – Zj row which are either
zero or positive.
Minimization Process
Artificial variable (An) is a variable that has no physical
meaning in terms of a real-world LP problem. It
simply allows us to create a basic feasible solution to
start the simplex algorithm.
An artificial variable is not allowed to appear in the
final solution to the problem.
Minimization Process
Artificial variable (An) has a large value which is used
as a computational device that prevents an equality
constraint from equating constant to zero and
prevents slack variable from becoming negative.
Hence, if the symbol of the constraints is ≥ we convert
the inequality to
by subtracting the slack variable but at the same time
add an artificial variable.
Minimization Process
In the constraints containing = symbol, add an artificial variable
to the left member to prevent the right member from being
equated to zero if the solution variables are all zero.
Minimization problems commonly deal with cost.
Slack variables do not contribute any amount to
cost, but artificial variables contribute the biggest
amount to cost in minimization problems. It
contributes to the objective an amount greater than
any of the coefficients in the solution variables.
Each artificial variable is assigned an extremely
high cost to ensure that it does not appear in the
final solution.
In representing the contribution of artificial
variables to objective function, we simply use
the power of ten (10, 100, 1,000,….)greater than
any of the coefficients in any of the solution
variables. Surplus variables, like slack variables,
carry a zero cost.
A surplus variable does have a physical meaning—it is
the amount over and above a required minimum level
set on the right-hand side of a greater-than-or-equal-
to constraint.
Whenever an artificial or surplus variable is added to
one of the constraints, it must also be included in the
other equations and in the problem’s objective
function, just as was done for slack variables.
Converting Constraints to Equation in a
Minimization Problem
1. Add an artificial variable An if the symbol
is =.
2. Add a slack variable Sn if the symbol is ≤.
3. Subtract a slack variable but add an
artificial variable if the symbol is ≥.
Example 1.
Minimize Z = 60x + 50y
Subject to : 3x + 5y ≤ 15
4x + 4y ≥ 16
x ≥ 0, y ≥

You might also like