Chapter+3+Test


 * __Your contribution to this page will get you one point extra credit for the Chapter 3 Test. Remember, I get the final say on whether or not your contribution was meaningful. The more you are willing/able to justify your contribution, the more willing I will be to give you a point. 1199215308

How will we organize this page?__**

On this //page// you can contribute: 1. A problem that you think will be asked on the test. 2. A link to a page that explains how to do problems that you think will be on the test. However, since this is so easy, you must "review" the page. This means to give a little blurb on what is good on the page and what is not. No points will be awarded for this unless it is STELLAR. Anyone can find stuff on the net. However, using/processing/reorganizing/contextualizing stuff on the net is a different matter. 3. A link to flashcards or pages with practice problems that can be used to review. 4. Other useful content.

On the //discussion// tab you can contribute: 1. A question about how to do a particular problem. 2. A question about vocabulary from the unit. 3. A suggestion about how to use the content that is posted on the page to get ready for the test and why you think that is a good idea.


 * __"On the Test":__**

-For the test, we will obviously need to know how to graph a set of given constraints, and from there, find the feasible region, and identify the vertices. Remember, that constraints are inequalities that all must be true in a problem, and therefore limit the possible outcomes of a problem. The feasible region is the solution that satisfies these constraints, and is therefore a region of truth. The vertices are the corners of the feasible region, where two of the graphed constraints intersect at one point. These types of problems can be found on page 191. I will do number 10 & its follow-up on number 14. First, you have to get all of the inequalities into a graphable format, I prefer using the y=mx+b method, but you can also use the intercepts method. Therefore, x+2y<=8 would become y<= -1/2x+4, and 2x+y>=10 would become y>= -2x+10, (x>=0 and y>=0 will remain the same). To graph this, I typed in "graph paper" on Google images, copied it onto the "Paint" program, used all the paint tools to graph, and then uploaded it onto this webpage by clicking the "insert images" button at the top...so anyone can use this method if you were wondering how to go about doing this, (unless you probably have a better way). (click the above link to view!) Now from that we can get the vertices: A(4,2), B(8,0), C(5,0) That's it. Now the feasible region, which is located inside these vertices, are all the true possibilities when abiding by the constraints of this problem. 1199563982