Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Successfully reported this slideshow.

Like this presentation? Why not share!

- Chapter 4 by universidad indus... 1840 views
- Procedure Of Simplex Method by itsvineeth209 30637 views
- Bba 3274 qm week 8 linear programming by Stephen Ong 3339 views
- Solving linear programming model by... by Roshan Kumar Patel 706 views
- Simplex method by tatteya 6136 views
- Soil release finish by Md. Abdul Hannan 184 views

No Downloads

Total views

4,988

On SlideShare

0

From Embeds

0

Number of Embeds

9

Shares

0

Downloads

95

Comments

0

Likes

1

No embeds

No notes for slide

- 1. Procedure of Simplex Method The steps for the computation of an optimum solution are as follows: Step-1: Check whether the objective function of the given L.P.P is to be maximized or minimized. If it is to be minimized then we convert it into a problem of maximizing it by using the result Minimum Z = - Maximum(-z) Step-2: Check whether all right hand side values of the constrains are non- negative. If any one of values is negative then multiply the corresponding inequation of the constraints by -1, so as to get all values are non-negative. Step-3: Convert all the inequations of the constraints into equations by introducing slack/surplus variables in the constraints. Put the costs of these variables equal to zero. Step-4: Obtain an initial basic feasible solution to the problem and put it in the first column of the simplex table.
- 2. Procedure of Simplex Method <ul><li>Step-5: Compute the net evolutions Δ j = Z j – C j (j=1,2,…..n) by using the relation Z j – C j = C B X j – C j . </li></ul><ul><li>Examine the sign </li></ul><ul><li>(i) If all net evolutions are non negative, then the initial basic feasible solution is an optimum solution. </li></ul><ul><li>(ii) If at least one net evolution is negative, proceed on to the next step. </li></ul><ul><li>Step-6: If there are more than one negative net evolutions, then choose the most negative of them. The corresponding column is called entering column. </li></ul><ul><li>(i) If all values in this column are ≤ 0, then there is an unbounded solution to the given problem. </li></ul><ul><li>(ii) If at least one value is > 0, then the corresponding variable enters the basis. </li></ul>
- 3. Procedure of Simplex Method <ul><li>Step-7: Compute the ratio {X B / Entering column} and choose the minimum of these ratios. The row which is corresponding to this minimum ratio is called leaving row. The common element which is in both entering column and leaving row is known as the leading element or key element or pivotal element of the table. </li></ul><ul><li>Step-8: Convert the key element to unity by dividing its row by the leading element itself and all other elements in its column to zeros by using elementary row transformations. </li></ul><ul><li>Step-9: Go to step-5 and repeat the computational procedure until either an optimum solution is obtained or there is an indication of an unbounded solution. </li></ul>

No public clipboards found for this slide

Be the first to comment