# Requirements space

Originally coined in linear programming, this represents the set of non-negative linear combinations of the columns of the matrix $LaTeX: \textstyle (A): \left \{Ax: x \ge 0 \right \}.$ For a linear program in standard form, the requirements space is the set of feasible right-hand sides, and it is a convex, polyhedral cone.