Reducing Cafe Costs using Linear Programming
Added on 2020-03-04
12 Pages418 Words85 Views
LINEAR PROGRAMMINGPROBLEM Case Study: Reducing Cafe CostsSTUDENT ID [Pick the date]
Case Study: Reducing Cafe Costs “Jane Lim who is café manager is trying to minimize the cost of the two main ingredients incasserole i.e. potatoes and green beans.”Given data and information are summarized below:Prices of the ingredientsIngredients$ per pound$ per gramsPotatoes0.306.61×10−4Green beans0.952.094×10−3Nutritional requirements in main dish NutritionGramsProtein160 grams160Iron65 milligrams0.065Vitamin C1000 milligrams1.00Edible casserole must contain the ingredient in the following ratioPotatoes: Green Beans6:5It means the weight ratio between potatoes to green beans should be ≥1.2.Amount of casserole needs to prepare in a week. 1
Minimum production of casserole12kg12000 gIngredient (protein, iron and vitamin C) information IngredientPotatoesGreen BeansProtein1.4g/100g5.9g/10ozIron0.255mg/100g3.56mg/10ozVitamin C11mg/100g29.75mg/10oz*28.35gram=10ozValues in grams IngredientPotatoesGreen BeansProtein0.0140.0208Iron0.255∗10−51.25∗10−5Vitamin C11∗10−51.049∗10−4Linear programing modelTask - To minimize the cost of caféLet x1=amountofpotatox2=amountof¿beansObjective function 2
minz=(6.61×10−4)x1+(2.094×10−3)x2Subject to constraints Protein: 0.014x1+0.0208x2≥160Iron (0.255∗10−5)x1+(1.25∗10−5)x2≥0.065Vitamin C (11∗10−5)x1+(1.049∗10−4)x2≥1Minimum casserole production x1+x2≥12000Ingredient requirement 5x1≥6x25x1−6x2≥0Non- negativity constraints x1,x2≥03
End of preview
Want to access all the pages? Upload your documents or become a member.
Related Documents
OMGT 2223 | Supply Chain Analysis and Design - Case Studylg...
|12
|294
|141