Refer to the Concept Byte linear programming activity on p. 163 in Algebra 2. Follow the step-by-step instructions at the top of the page. Complete each of the following tasks for exercise problems 1–4. 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. the problems on pg. 163 are {4x+3y >/ 30 x+3y >/ 14 x >/0 , y >/ 0
>/ = greater than or equal to sign </= less than or equal to sign im posting the rest minimum for c= 5x+8y 2. 3x+5y >/ 35 2x+y </ 14 x >/ 0, y>/ 0 maximum for p= 3x+2y 3. x+y >/ 8 x+5y>/ 20 x >/ 0, y >/ 2
Join our real-time social learning platform and learn together with your friends!