This paper defines, develops algorithms for, and illustrates the utility in design of a class of mathematical operations. These 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 “domain” of the other vector, in the sense that all combinations of the output vector values set and values for A, when inserted into the constraint equation, correspond to values for the input vector that lie within the input interval. These operations have been mostly overlooked by the interval matrix arithmetic community, but are mathematically interesting and useful in the design, for example, of structures.