(2.3) Basic feasible solutions in standard form polyhedra with
upper bounds. Consider a polyhedron defined by the constraints Ax =
b and 0 ≤ x ≤ u. Assume that the matrix A has linearly independent
rows and that ui > 0 for all i. Provide a procedure analogous to
the one in Section 2.3 for constructing basic solutions, and prove
an analog of Theorem 2.4.
From book Introduction to linear optimization by Bertsimas

