El-Shorouk Academy Acad. Year : 2012/ 2013 Higher Institute for Computer & Term : Second Information Technology Year : First Department of Computer Science 1206 Operations Research Section # 5 The Simplex Method Special Cases in Simplex Method 1. Degeneracy...
More
El-Shorouk Academy Acad. Year : 2012/ 2013 Higher Institute for Computer & Term : Second Information Technology Year : First Department of Computer Science 1206 Operations Research Section # 5 The Simplex Method Special Cases in Simplex Method 1. Degeneracy One or more basic variable(s) has zero value. If you find more than one leaving variable (i.e.; we have two or more variables having the same ratio in the R.H.S) so one or more of the basic variable(s) will be equal zero in the next iteration. This condition indicates that the model has at least one redundant constraint. Example 1: Maximize Z= 3 X1 + 9X2 S.T X1 + 4 X2 <= 8 X1 + 2 X2 <= 4 X1, X2 >=0 Standard LP form Maximize Z=3X1 + 9X2 S.T X1 + 4X2 + X3 =8 X1 + 2X2 + X4 = 4 X1, X2, X3, X4 >=0 Ta.M.3ed Page 1 of 6
Less
