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

Algorithms

This document outlines the steps of the simplex algorithm for solving linear programming problems (LPP). It begins with selecting an initial basic feasible solution and expressing the problem in standard form. It then iterates between calculating net evaluations to select an entering variable, finding a leaving variable via ratios, and updating the basis until an optimal solution is reached where all net evaluations are non-negative.

Uploaded by

Suraj Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
25 views

Algorithms

This document outlines the steps of the simplex algorithm for solving linear programming problems (LPP). It begins with selecting an initial basic feasible solution and expressing the problem in standard form. It then iterates between calculating net evaluations to select an entering variable, finding a leaving variable via ratios, and updating the basis until an optimal solution is reached where all net evaluations are non-negative.

Uploaded by

Suraj Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

ALGORITHM

Variables Xr and it is indicated by an arrow at the bottom of the rth column.


If there are more than one variable having the same most negative Zj-Cj any
one the variable can be selected arbitrary as the entering variable.

(a)If all Xir<=0(i=1,2,..m) then there is unbounded solution to the given


variable.

(b)If at least one Xir>0(i=1,2,…m) then the corresponding vector Xv enters


the basis.

For the solution of any LPP by Simplex algorithm the existence of an initial
basic solution assumed.

The following steps show how the optimal solution can be obtained.

Step 1: Check first whether it is maximize/minimize .If minimized then


convert it into maximization form by Min Z=Max(-Z)

Step 2: Check whether all bi(i=1,2,..m) are positive .If any one of the bi is
negative then multiply the inequality by -1 as to get to be positive.

Step 3: Express the problem in standard form by introducing Slack variables


to convert the inequality constraints into equations.

Step4: Obtain an initial basic feasible solution in the form Xb=B-1 and put it
in the first column of the simplex table.

Step5: Complete the net evaluations Zj-Cj; choose the most negative of
them. Let it be Zr-Cr for some j=r. This gives the entering.

Step6: Complete the net evaluations Zj-Cj = Cb(aj-cj), if Zj-Cj>=0, all then we
get the basic feasible solution ,if at least one Zj-Cj<0, then we go to the
next iteration.

Step7: If the column of the ratios be Xbi/Xik then choose the variable Xk to
leave the basic called the key row and the key column. The element at the
intersection of key row and key column is called the key element.

Step8: Form a new basis by dropping the leaving variable and introducing
the entering variable along with associated value under Cb column. Correct
the leading element to unity by the key equation by key elements in its
columns to 0 by using the formula:-

New element=Old element-[Product of the element in row and


key column]/key element

Step9: Goto step 5 and repeat the procedure until either an optimum
solution is obtained and there is an introduction of unbounded solution.

You might also like