0
Still curious? Ask our experts.
Chat with our AI personalities
Rafa
Lao
DevinAdd your answer:
Earn +20 pts
What is the feasible region in linear programming?
Linear programming is just graphing a bunch of linear inequalities. Remember that when you graph inequalities, you need to shade the "good" region - pick a point that is not on the line, put it in the inequality, and the it the point makes the inequality true (like 0
Where to shade when graphing inequalities?
When graphing inequalities, you shade all areas that x and/or y can be. If the number is x, you shade left and right. If x is anywhere from -11 to ∞, then shade the area to the right of -11. If it is from -∞ to 5, shade the areas to the left of 5. If the number is y, then you go up and down, so if y is anywhere from 0 to ∞, shade all the areas above 0, and if it is from -∞ to 100, shade all the areas below 100. Combining x and y, usually restricts the areas you should shade. For example, if x is from -∞ to 7, and y is 3 to ∞, you would ONLY shade the areas that are to the left of 7 AND above 3.
When graphing a system of inequalities the line is dotted for the?
strict inequality
How is graphing an inequality different than graphing an equation?
Not greatly. To graph an inequality, you start off graphing the corresponding equality. It is only then that you select one side or the other (with or without the graph itself), as the region of interest.
When graphing inequalities when do you have a closed circle?
When the value indicated by the circle is a valid value for the inequality.
