This paper defines, develops algorithms for, and illustrates the design use of a class of mathematical operations. These operations accept as inputs a system of linear constraint equations, Ax = b, an interval matrix of values for the coefficients A, and an interval vector of values for either x or b. They return a set of values for the other variable that is “sufficient” in this sense. Suppose that ◯ is an interval of input vectors, and  an interval matrix. Then, one Sufficient-Points operation returns a set of vectors ~ such that for each b in ~, the set of x values that can be produced by inserting all the values of  into Ax = b is a superset of the input vector x. These operations have been partly overlooked by the interval matrix mathematics community, but are mathematically interesting and useful in the design, for example, of circuits.