Linear Programming

KEYWEST17

New member
Joined
Jan 19, 2011
Messages
46
A diet is to contain at least 1168 units of carbohydrates, 1816 units of proteins, and 2172 calories. Two foods are available: F_1 which costs $ 0.08 per unit and F_2, which costs $ 0.05 per unit. A unit of food F_1 contains 1 units of carbohydrates, 2 units of proteins and 4 calories. A unit of food F_2 contains 9 units of carbohydrates, 8 units of proteins and 6 calories.

Find the minimum cost for a diet that consists of a mixture of these two foods and also meets the minimal nutrition requirements.

Corner points of the feasible region: ________________________________________
If there is more than one corner point, type the points separated by a comma (i.e. (1,2),(3,4)).

Minimum cost is: $_______
when F_1 =______ units
and F_2 =_______ units.
 
Follow the pattern you were just shown with the skis. Show us what you get.
 
you need to establish an objective function and find the constraints.
Solve this using the graphical method by graphing the constraint equations and finding all the points of interesetion by solving simulatneouly and the smallest value is your answer
 
Top