MGMT2012: Quantitative Methods

Project: Linear Programming

Green Juices
Formulation of the Linear Problem
Decision Variables:
Let A= number of ounces in Ingredient A
B = number of ounces in Ingredient B
C = number of ounces in Ingredient C
D = number of ounces in Ingredient D
Objective function: To minimize costs per daily dose ($ in dollars)
=$0.40A + $0.20B + $0.60C + $0.30D
Subject to constraints:
 3A + 4B + 8C + 10D ≥ 280 (Chemical X constraint)
 5A + 3B + 6C + 6D ≥ 200 (Chemical Y constraint)
 10A + 25B + 20C + 40D ≤ 1,050 (Chemical Z constraint)
 A + B + C + D ≥ 36 (Consumption constraint [ounces per day])
 A,B,C,D ≥ 0 (nonnegativity constraint)
 A,B,C,D ≥ 3 (ingredients constraint)