Scribd
Upload
4 views3 pages

Simplex Method

The Simplex Method is an algorithm for solving linear programming (LP) problems that iteratively improves the objective function until an optimal solution is found. It involves the use of a Simple Tableau to track calculations, with key concepts such as basis, iterations, and various rows (Cj, Zj, ∆j) that guide the selection of entering and departing variables. The method requires converting inequalities into equations, constructing an initial tableau, and performing calculations to reach the optimal solution.

Uploaded by

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

Simplex Method

The Simplex Method is an algorithm for solving linear programming (LP) problems that iteratively improves the objective function until an optimal solution is found. It involves the use of a Simple Tableau to track calculations, with key concepts such as basis, iterations, and various rows (Cj, Zj, ∆j) that guide the selection of entering and departing variables. The method requires converting inequalities into equations, constructing an initial tableau, and performing calculations to reach the optimal solution.

Uploaded by

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

Simplex Method

1) Simplex Method: An algorithm for solving LP problems which starts with zero solution
(i.e. zero value of decision variables), evaluates solution, effects changes to improve value of
the objective function and continues doing so until an optimal solution is obtained. (Applicable
when Decision Variables are more than 2.)

2) Simple Tableau: A table used to keep track of the calculations made at each iteration of the
simplex procedure and to provide basis for tableau revision.

3) Basis: The set of basic variables which are not restricted to equal zero in the current basic
solution and are listed in the solution column. The variables with non-zero positive values
which make-up the basis are called basic variables and the remaining variables are called non-
basic variables.

5) Iteration: A sequence of steps performed in moving from one basic feasible solution to
another basic feasible solution.

6) Cj Row: A row in the simplex tableau which contains the co-efficient of the variables in the
objective function. The coefficients in this row indicates the contribution/profit per unit for
each product which are denoted by the variables.

7. Zj Row: A row in the simplex tableau whose elements represent the decrease in the value of
the objective function (i.e. contribution loss per unit) if one unit of the variable is brought into
the solution.

8. ∆j= Cj- Zj Row or Index Row or Net Evaluation Row (NER): A row in the simplex
tableau whose elements represents net per unit contribution of the jth variable in the objective
function, if the variable is brought into the new basic solution. Positive ∆j indicates gain and
negative value indicates loss in the total value Z obtained.

9. Key Column: The column with the largest positive index number (i.e. number in the Cj - Zj
row) and it indicates which variable will enter the solution next.

10. Key Row: The row with the smallest positive value in the replacement ratios. The
replacement ratios are obtained by dividing element in the solution column (quantity column)
by the corresponding elements in the key column. The key row indicates the variable that will
leave the basis in order to make room for entering variable (as indicated by the key column).
11) Key Element: The element at the intersection of key row and key column.

12) Slack Variable: A variable used to convert a less than or equal to restriction (≤) into
equality is known as surplus variables. It is subtracted from the left-hand side of the constraint.

Steps to solve Simplex Method

1) Convert the LPP in the Standard form as follows Convert inequalities into equations by
adding slack variables on LHS of inequations, these slack will be there in objective function
with zero coefficient and these variables will be non-negative.

2) To construct initial table, post the following entries

a) List all variables used in problem

b) Post Cj values which corresponds to coefficients of variables from objective function also
post coefficients of variables from each equations

c) bi value corresponds to right hand side constant.

1 0 0
1 0
d) Xi denotes variables which corresponds to identity matrix [ ] or 0 1 0
0 1
0 0 1

e) Ci represents coefficients of variables of Xi column from objective function

3) Calculate Zj as follows :

Zj= Sum (Ci x element from respective column)


4) Calculate ∆j = Cj-Zj

5) If ∆j ≤ 0 and go to step 13

6) If any one of the ∆j ≥ 0 go to step 7

7) Select most positive ∆j value, this column is called as key column (KC) and the variable in
the key column is called as entering variable (EV)

ᶿ
8) Calculate replacement ratio (or minimum ratio) = bi / element from key column (consider

only positive ratios)

9) Select least positive ratio which corresponds to key row (KR) and the variable in the key
row is called as departing variable (DV)
10) The element which is common to key row and key column is called as key element (KE)
or pivot element.

11) To construct new table, proceed as follows and do 2 calculation

1) Divide the Key Row by Key element (this row is Revised row)

2) Find other rows as follows :

New Row = Corresponding Old Row - (Intersection of Old Row and key column * Revised
row element)

12) Go to step 3

13) Solution is optimum


14) Stop

You might also like