An interesting question for linear programming (LP) algorithms is how to deal with solutions in which the number of nonzero variables less than rows matrix standard form. approach that basis deficiency-allowing (BDA) simplex variations, work a subset independent columns coefficient form, wherein not necessarily represented by square matrix. We describe one such algorithm several variants. The r...