does anyone understand how to do feasible regions and the constraint things?
Yuppers. :) Question for you -- what graphing program are you using?
what does that mean??
like my graphing calculator or the problem?
I mean "what are you using to visualize the problem" -- are you graphing by hand, are you using geogebra, grafeq, wolframalpha, a handheld calculator, etc?
well i have a graphing calculator and graph paper...but i have to graph it on the paper and do a lot of confusing work.
Usually these problems are three steps: 1) Graph & shade each inequality 2) Find the intersection points of the closed shape (usually a rectangle or triangle or some polygon) 3) Evaluate your OBJECTIVE FUNCTION at each of those points Which of those steps do you feel confident about, which are more confusing, etc?
the objective function because i have no idea what that is. I think I understand the other stuff....maybe.
The 'Objective function" is usually the quantity you are trying to minimize (or maximize). It usually has two variables: Cost = 10x + 2y
okay so if it say C=x+3y i plug my points into that?
Yes, but you don't plug in just any points. You'd plug in the vertices|dw:1319669593708:dw| of the feasible region.
Oh, okay. I think I understand now. So then if you are looking for the minimum then it would be the point that has the smallest answer. Right?
Join our real-time social learning platform and learn together with your friends!