Name
Date
Systems of inequalities and linear programming — Homework
List every vertex first, then evaluate the objective function at each one before naming the maximum.
- 1.Vertices (0,0), (0,6), (3,5), (8,0); P=50x+60y. Evaluate P at each vertex and state the maximum.
- 2.Is (0,0) a solution to x+3y<=18?
- 3.Why do we only need to test the corner points, not every point in the feasible region, to find a maximum?
- 4.A t-shirt shop has profit P=8x+6y with constraints x+y<=50 and 2x+y<=80. Find all four vertices (with the axes and their intersection).
- 5.Using those vertices and P=8x+6y, which vertex gives the maximum profit?
🌲 Homeschool of the FutureEleventh Grade · Math · week 7 homework