Graph the system of constraints and find the value of x and y that maximize the objective function. (1 point) (0, 0) (2, 3) (5, 0) (0, 3)
@JakeV8
I am still learning these too... but here's what I think I know...
just graph the inequalities that are the constraints. This is straightforward, just like when you first learned about y < x or whatever. The space or region that is the overlapping area of those constraints represents the possible set of x,y points for the objective equation.
Here's the part I'm less sure of: I think the technique is simply a smart trial and error. Choose an x and y, find the objective function value. Choose a better x or better y, repeat, and compare. I think this is the topic of some algorithm classes... developing efficient algorithms at finding optimal solutions within highly constrained spaces. Engineering, by chance?
So then what should I do?
well, thankfully, you have multiple choice. Just try each of those answers and evaluate C from the objective function, and the answer that makes the biggest C value wins.
@sue101 Does this help? I have to run in a sec and didn't get a chance to plot the inequalities. I think you just sketch those out, and then try the options from the multiple choice one at a time. "Maximize the objective function" means "pick the x,y pair that gives the largest value of C" good luck!
Join our real-time social learning platform and learn together with your friends!