Is there an algorithm to detect the existence of Degeneracy before solving a given Linear Programming problem by simplex method (search through extreme points)?
Asked
Active
Viewed 52 times
1
-
A Linear Programming problem is not degenerate, a pivot of the simplex algorithm eventually is. – Kuifje Nov 04 '16 at 15:59
-
My wording is wrong. But I think you understand my question. – venkatesan Nov 10 '16 at 18:16
-
When Dantzig conceives the extreme point method initially, he did not anticipate the problem of degeneracy; Later he takes this into account. – venkatesan Nov 10 '16 at 18:20