This has to do with linear programming. Creatine L-Glutamine BCAAs Cost (grams) (grams) (grams) ($) Xtendo 0

This has to do with linear programming. 

Transcribed Image Text:

Creatine L-Glutamine BCAAs Cost (grams) (grams) (grams) ($) Xtendo 0 2.5 7 0.80 (Scivation) RecoverMode 3 3 5 1.20 (Evolution Nutrition) Strongevity 3 1 0 1.00 (Bill Phillips) Muscle Physique 2 2 0 0.50 (EAS) Your personal trainer suggests that you supplement with at least 15 grams of creatine, 60 grams of L-glutamine, and 105 grams of BCAAs each week. You are thinking of combining Xtend and RecoverMode to provide you with the required nutrients. How many servings of each should you combine to obtain a week's supply that meets your trainer's specifications at the least cost? Let x = number of servings of Xtend, let y = number of servings of RecoverMode, and let c = cost (in dollars). Determine the objective and the constraints needed to solve the problem. Objective minimize VC= Constraints 15 60 105 x 0, y 0 Graph the feasible region and determine the coordinates of all corner points. (Round your answers to one decimal place.) smallest x-value (x, y) = (x, y) == largest x-value (x, y) = The minimum value of c occurs at which corner point? (x, y) = a Creatine L-Glutamine BCAAs Cost (grams) (grams) (grams) ($) Xtendo 0 2.5 7 0.80 (Scivation) RecoverMode 3 3 5 1.20 (Evolution Nutrition) Strongevity 3 1 0 1.00 (Bill Phillips) Muscle Physique 2 2 0 0.50 (EAS) Your personal trainer suggests that you supplement with at least 15 grams of creatine, 60 grams of L-glutamine, and 105 grams of BCAAs each week. You are thinking of combining Xtend and RecoverMode to provide you with the required nutrients. How many servings of each should you combine to obtain a week's supply that meets your trainer's specifications at the least cost? Let x = number of servings of Xtend, let y = number of servings of RecoverMode, and let c = cost (in dollars). Determine the objective and the constraints needed to solve the problem. Objective minimize VC= Constraints 15 60 105 x 0, y 0 Graph the feasible region and determine the coordinates of all corner points. (Round your answers to one decimal place.) smallest x-value (x, y) = (x, y) == largest x-value (x, y) = The minimum value of c occurs at which corner point? (x, y) = a

Answer rating: 100% (QA)

The feasible region is the shaded area in the graph above To find the corner points we need to find the intersections of the boundary lines of the fea... View the full answer