1 / 19

Simplex method : Tableau Form

Simplex method : Tableau Form. Maximise Z= 10X1+9X2+0S1+0S2+0S3+0S4 subject to: 7/10X1+1X2+1S1 =630 1/2X1+5/6X2+ +1S2 =600 1X1+2/3X2 +1S3 =708 1/10X1+1/4X2 +1S4 =135 X1,X2,X3,X4,S1,S2,S3,S4 > 0

mohammad-ellis
Download Presentation

Simplex method : Tableau Form

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Simplex method : Tableau Form Maximise Z= 10X1+9X2+0S1+0S2+0S3+0S4 subject to: 7/10X1+1X2+1S1 =630 1/2X1+5/6X2+ +1S2 =600 1X1+2/3X2 +1S3 =708 1/10X1+1/4X2 +1S4 =135 X1,X2,X3,X4,S1,S2,S3,S4 > 0 Constraints equations make more variables (six) than equations (four), the simplex method find solutions for these equations by assigning zero values to variables A basic solution can be either feasible or infeasible. A basic feasible solution is a solution which is both basic and satisfy non negativity condition.

  2. Simplex Form cj = objective function coefficient for variables j bj = right hand side coefficient for constraints i aij = Coefficient associated with variable j in constraint i c1 c2 …………………………………………….cn -------------------------------------------------------------------------------------- a11 a12 ……………………………………………… a1n b1 a21 a22 ………………………………………………..a2n b2 …………………………………………………………………………. …………………………………………………………………………. am1 am2 amn bm C(row) = row of objective function coefficient b(column)= column of right hand side value of the constraint equation A(matrix) = m-row and n-column of coefficient of the variables in the constraint equations

  3. Simplex Tableau

  4. Improving the Solution Zj represents the decrease in profit that will result if one unit of X1 is brought into the solution Cj-Zj - net evaluation row Values in Zj row is calculated by multiplying the element in the cj column by the corresponding elements in the column of the A matrix and summing them. The process of moving from one basic feasible solution to another is called iteration. We select the entering variable that has the highest coefficient in the net evaluation row. Criteria of moving a variable from the current basic: For each row i compute the ratio bj/aij> 0. This ratio tells us the maximum amount of the variable Xj that can be brought into the solution and still satisfy the constraint equation represented by that row. Select the basic variable corresponding to the minimum of these ratios as the variable to leave.

  5. Optimality Optimality Condition: The optimal solution to a LP problem has been reached when there are no positive values in the net evaluation row of the simplex tableau. Pivot Row : • Replace the leaving variable In the basic column with the entering variable. • New pivot row = current row divided by pivot element All other rows including Z : New row : Current row – (pivot column element) X ( New pivot row)

  6. Condition for Optimal Solution Cj-Zj< 0 for both of the non-basic variables S1 & S2, an attempt to bring non- basic variables into basic will lower the current value of the objective function. The optimal solution of a LP problem has been reached when there are no positive values at the net evaluation row. X1 540 X2 252 S1 0 S2 120 S3 0 S4 18

  7. Sample Problem Max.4X1+6X2+3X3+1X4 s.t 3/2X1+2X2+4X3+3X4<550 4X1+1X2+2X3+1X4<700 2X1+3X2+1X3+2X4<200 X1, X2, X3, X4 >0 Problem in standard form: Max> 4X1+6X2+3X3+1X4+0S1+0S2+0S3 s t 3/2X1+2X2+4X3+3X4+1S1 = 550 4X1+1X2+2X3+1X4 +1S2 = 700 2X1+3X2+1X3+2X4 +1S3 = 200 X1, X2, X3, X4, S1, S2, S3 > 0

  8. Initial Simplex Tableau

  9. Iteration :1…

  10. Iteration 2….

  11. Treating Constraints • Eliminating negative right hand side: The number of std bag had to be less or X1 < X2-25 equal to the number of deluxe bag after 25 1X1 - 1X2 < -25 bags had been set aside for displaying -X1 + X2 > 25 purpose Greater than equal to constraint : 6X1 + 3 X2 -4X3 > -20 -6X1 – 3X2 + 4 X3 < 20

  12. Simplex Problem Max. 10X1 + 9 X2 s t 7/10X1+1X2 < 630 1/2X1+5/6X2 < 600 1X1+2/3X2 < 708 1/10X1+1/4X2 <135 1X1 >100 a5, a6 (artificial variables) 1X2 >100 very large cost -M Max. 10X1+9X2+ 0S1+S2+0S3+0S4+0S5+0S6-Ma5-Ma6 s t. 7/10X1+1X2+1S1 = 630 1/2X1+5/6X2 +1S2 =600 1X1+2/3X2 +1S3 =708 1/10X1+1/4X2 +1S4 =135 1X1 -1S5+1a5 =100 1X2 -S6+1a6 =100

  13. Equality Constraints Max. 6X1+3X2+4X3+1X4 s t -2X1-1/2X2+1X3+-6X4 = -60 1X1 +1X3+2/3X4<20 -1X2-5X3 <-50 X1, X2, X3, X4> 0 Max. 6X1+3X2+4X3+1X4+0S2+0S3-Ma1-Ma2 st 2X1+1/2X2-1X3+6X4 +1a1 = 60 1X1 +1X3-2/3X4 +1S1 = 20 1X2+5X3 -1S3 +1a5= 50 X1, X2, X3, X4, S2, S3, a1, a3 > 0

  14. Sensitivity Analysis Study of how optimal solution and value of optimal solution to a LP given a changes in the various coefficients of the problem: 1. What effect on the optimal solution will a change in a coefficient of the objective function (Cj) have? 2. What effect on the optimal solution will a change in constraint in right hand side value (bj) have? 3. What effect on the optimal solution will a change in a coefficient of a constraint equation (aij) have?

More Related