Linear Programming(LP) Exercise 2.12 Consider a nonempty polyhedron P and suppose that for each variable xi we have either the constraint xi geq 0 or the constraint xi leq 0. Is it true that P has at least one basic feasible solution? Solution Say if it is m dimensional polyhydra even then one basic solution is (0, 0 , 0......,0)(m times), as intersection of conditions on xi will yield this as one vertex of polyhydra ..