1. Rewrite the constraints in slope-intercept form. 2. List all vertices of the feasible region as ordered pairs. 3. List the values of the objective function for each vertex. 4. List the maximum or minimum amount, including the x, and y-value, of the objective function.

Question

anonymous · Answer

attachment

anonymous · Answer

anyone know how to do this?

anonymous · Answer

like anything will help cause idk what to do :/

schrodinger · Answer

Yup. Nope. Nope. Saw those less than or equal to signs, don't remember it, at all. Kill it with fire.  Sorry.

anonymous · Answer

:|

schrodinger · Answer

xP I'm sorry. There's got to be someone around here, just keep promoting it. @Algebraic! Pl0x HLP

schrodinger · Answer

Help us, @AccessDenied , you're his only hope.