A-priori upper bounds for the set covering problem

A matrix M∈R^n×n is said to be a column sufficient matrix if the solution set of LCP(M,q) is convex for every q∈Rⁿ. In a recent article, Qin et al. (Optim. Lett. 3:265–276, 2009) studied the concept of column sufficiency property in Euclidean Jordan algebras. In this paper, we make a further study of this concept and prove numerous results relating column sufficiency with the Z and Lypaunov-like properties. We also study this property for some special linear transformations.