The 2-D (i.e. (x,y)) graph of a problem that requires y to be any number (not necessarily integer) between 22 and 32 (inclusive on both ends) and x to be an integer between 0 and 8 (inclusive on both ends) has a feasible region _________.

of 99 dots.

of 8 horizontal stripes.

of 9 vertical stripes.

of 9 horizontal stripes.

of 8 vertical stripes.

PreviousNext