Sometimes, the constraints in optimization problems look like sub(a,1)sub(x,1)+...+sub(a,n)sub(x,n)c, assuming n decision variables. To clarify, suppose that the sub(x,i)s represent dollars, and for some reason, they seem to work better with hundreds of dollars. Let the sub(y,i)s be the new variables representing thousands of dollars. If after solving, you find that sub(y,1)=9,837.43 and sub(y,2)=577.67, what are the actual dollar amounts? $983,743 and $57,767 respectively $98.37 and $5.78 respectively $5.77 and $98.37 respectively $98,374,300 and $5,776,700 respectively