Question 762205
<font face="Times New Roman" size="+2">


It depends.  You need to let the number of computation problems be one of your linear variables and the number of word problems be the other linear variable.  The range of your feasible area is the set of possible feasible values for the variable that you assign to the vertical axis, presuming you are using the term "range" correctly.  Either way, you know that you cannot answer an negative number of either type of question, so you know for certain that the lower limit on your range interval is zero.


So set up your two constraint inequalities in addition to the two trivial ones *[tex \LARGE x\ \geq\ 0] and *[tex \LARGE y\ \geq\ 0], and then compute the *[tex \LARGE y]-intercepts for each of the boundary lines for the two non-trivial constraints.  The smaller *[tex \LARGE y]-coordinate will be the upper limit of the range.


John
*[tex \LARGE e^{i\pi}\ +\ 1\ =\ 0]
<font face="Math1" size="+2">Egw to Beta kai to Sigma</font>
My calculator said it, I believe it, that settles it
<div style="text-align:center"><a href="http://outcampaign.org/" target="_blank"><img src="http://cdn.cloudfiles.mosso.com/c116811/scarlet_A.png" border="0" alt="The Out Campaign: Scarlet Letter of Atheism" width="143" height="122" /></a></div>
</font>