Scribd
Upload
172 views3 pages

On Simplex Method With Surplus Variables With An Example.: Dr. B. C. Roy Engineering College, Durgapur

This document summarizes the simplex method for solving linear programming problems with surplus variables. It defines surplus variables as variables subtracted from inequality constraints to convert them to equalities. The methodology section outlines converting an LP problem to standard form by making all variables non-negative and constraints equalities. An example problem is provided showing how surplus variables x3 and x4 are subtracted from two constraints to convert them to equalities. The simplex method is then used to find the optimal solution.

Uploaded by

Surbhi Pal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
172 views3 pages

On Simplex Method With Surplus Variables With An Example.: Dr. B. C. Roy Engineering College, Durgapur

This document summarizes the simplex method for solving linear programming problems with surplus variables. It defines surplus variables as variables subtracted from inequality constraints to convert them to equalities. The methodology section outlines converting an LP problem to standard form by making all variables non-negative and constraints equalities. An example problem is provided showing how surplus variables x3 and x4 are subtracted from two constraints to convert them to equalities. The simplex method is then used to find the optimal solution.

Uploaded by

Surbhi Pal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Dr. B. C.

Roy Engineering College ,Durgapur

Name: Surbhi Pal


University Roll: 12000219055
Semester: 7
Department: Information Technology
Paper Name: Operations Research
Paper Code:OEC-IT-701A

Report on Simplex Method


with Surplus Variables with an
example.

Introduction:

Simplex Method was developed by George Bernard Dantzig. The name of the
algorithm is derived from the concept of a simplex and was suggested by T. S.
Motzkin.It is a systematic procedure for testing vertices as possible
solutions.Simplex Method or Simplex Algorithm is used for calculating the
optimal solution to the linear programming problem.

Methodology:

The simplex method for solving an LP problem requires the problem to be


expressed in the standard form. But not all LP problems appear in the
standard form. In many cases, some of the constraints are expressed as
inequalities rather than equations; at least it is most often true in case of water
resources problems. In some problems, all the decision variables may not be
even nonnegative. Hence, the first step in solving an LP problem is to convert
it to the standard form. The procedure to convert a general program to the
standard form is outlined below:

 Convert all inequalities to equalities.

 Convert all decision variables unrestricted in sign to strictly non-negative.

 Make all the right-hand side constants of the constraints nonnegative.

Properties:

 The Simplex method for maximizing the objective function starts at a basic
feasible solution for the equivalent model and moves to an adjacent basic
feasible solution that does not decrease the value of the objective function.
 If an artificial variable is in an optimal solution of the equivalent model at a
nonzero level, then no feasible solution for the original model exists. On
the contrary, if the optimal solution of the equivalent model does not
contain an artificial variable at a non-zero level, the solution is also optimal
for the original model.
 If all the slack, surplus, and artificial variables are zero when an optimal
solution of the equivalent model is reached, then all of the constraints in
the original model are strict “equalities” for the values of the variables that
optimize the objective function.
 If a non-basic variable has zero coefficients in the objective function
equation when an optimal solution is reached, there are multiple optimal
solutions. In fact, there is infinity of optimal solutions, the Simplex method
finds only one optimal solution and stops.
 Once an artificial variable leaves the set of basic variables (the basis), it
will never enter the basis again, so all calculations for that variable can be
ignored in future steps.
 If a basis has a variable at zero level, it is called a degenerate basis.

Surplus Variables:
In an optimization problem, a surplus variable or negative slack variable is
a variable that is subtracted to an inequality constraint to transform it into
equality. Introducing a surplus variable replaces an inequality constraint
with
an equality constraint and a non-negativity constraint on the surplus
variable. The term “surplus” applies to greater than or equal constraints.If a
constraint is binding then the corresponding slack or surplus value will equal
zero.
If a constraint has >= sign,in order to make it an equality,we have to subtract
something non-negative from its left hand side.The non-negative variable
which is subtracted from the left hand side of the constraint to convert it into
equation is called surplus variable.

Example and Result:

Eg: x1+x2>=4
2x1+4x2>=5
We subtract surplus variables x3,x4>=0
x1+x2-x3=4
2x1+4x2-x4=5

Conclusion:
The simplex method is used to eradicate the issues in linear programming.
It examines the feasible set's adjacent vertices in sequence to ensure that, at
every new vertex, the objective function increases or is unaffected.

References:
https://www.sciencedirect.com/topics/earth-and-planetary-sciences/simplex-
method
http://pages.intnet.mu/cueboy/education/notes/algebra/simplex.pdf
https://cumaths.com/slack-and-surplus-variables/

You might also like