Tie in selection of key row|Degeneracy in Simplex method|Tie for theta|Tie for minimum ratio|LPP|GTU
HTML-код
- Опубликовано: 16 сен 2024
- Explained beautifully degeneracy with solution of problem.
Tie for minimum positive ratio in linear programming problem. i.e. tie in selection of key row.
For more videos of Operation Research, go to playlist from my RUclips channel where I have prepared topic wise playlist. So you can take maximum advantage according to your interest.
#degeneracy in LPP
#degeneracy
#tie for key row
#tie for key column
#same value for key column
#same value for key row
#tie in column
#tie in row
#tie for entering variable
#tie for leaving variable
#simplex method
#selection of key element
#selection of pivot
#tie in key column
#tie in key row
#same value in key column
#degeneracy in LPP
Great Sir. You cleared my doubts on degeneracy
Thank you my dear friend
very good work sir
Thank you
Some sources say that in case of a tie in the ratio, we can choose any row arbitrarily. So, why do we apply this method for selecting the key row?
It will reduce your iteration steps
what if the coefficient is negative in the slack variables? wont the minimum ratio be negative then?
Sir is there is any situation where you can choose 0 in minimum ratio?
Means?
@@vipulgoti47 any such conditions where we needs to choose 0 as minimum ratio for key row?
@@BikramAdhikari-jz4gr no
what if the minimum ratio of one row is undefined? (12/0)
Skip and go for next step
Sir is zero can be taken as min ratio?
No
@@vipulgoti47 thank you sir. very helpful😊
What happened if key elements will zero
It will not happen
@@vipulgoti47 then my calculation is wrong if key element is zero
@@mohammadimran1113 yes mohammad