0% found this document useful (0 votes)
18 views6 pages

Resource Allocation LP - Group 5

Alpujarra Food Services Company delivers sandwiches to vending machines daily and wants to know how many of each type (cheese, bologna, chicken salad) to make to maximize profits. A linear programming model was formulated with the objective to maximize total profits and constraints for assembly time, vending machine capacity, and minimum quantities of each sandwich. Solving the model showed the optimal quantities were 1,000 cheese sandwiches, 800 bologna sandwiches, and 200 chicken salad sandwiches for a maximum profit of $760.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
18 views6 pages

Resource Allocation LP - Group 5

Alpujarra Food Services Company delivers sandwiches to vending machines daily and wants to know how many of each type (cheese, bologna, chicken salad) to make to maximize profits. A linear programming model was formulated with the objective to maximize total profits and constraints for assembly time, vending machine capacity, and minimum quantities of each sandwich. Solving the model showed the optimal quantities were 1,000 cheese sandwiches, 800 bologna sandwiches, and 200 chicken salad sandwiches for a maximum profit of $760.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

ALPUJARRA FOOD SERVICES &

THE COMIDA SANA - EXERCISE


Group 5
1. R. Sukma Nugraha A – 15122320025
2. Reynard Nathaniel – 15122320027
3. Sarah Hanifa Purnomo – 15122320045
4. Tri Wicaksono – 15122320041
1. Alpujarra Food Services Company Maximize Z = 0,35X1 + 0,42X2 + 0,37X3
Subject to:
0,45X1 + 0,42X2 + 0,50X3 ≤ 960
X1 + X2 + X3 ≤ 2.000
X1 - X2 - X3 ≥ 0
X1, X2, X3 ≥ 200
X2 ≥ 200
X3 ≥ 200
Where:
X1 = Number Stock of Cheese
X2 = Number Stock of Bologna
X3 = Number Stock of Chicken Salad

Maximize Z = 0,35*1.000 + 0,42*800 +


0,37*200 = 760

Conclusion:
To get maximum profits, the company needs to make sandwiches with the
following quantity composition:
1. 1.000 slices of Cheese Sandwich
2. 800 slices of Bologna Sandwich
3. 200 slices of Chicken Salad Sandwich
The profit generated is USD760

Alpujarra Food Services Company delivers fresh sandwiches each morning to vending machines throughout the city. The company makes three kinds of sandwiches— cheese, bologna,
and chicken salad. A cheese sandwich requires a worker 0.45 minutes to assemble, a bologna sandwich requires 0.41 minutes, and a chicken salad sandwich requires 0.50 minutes to
make. The company has 960 available minutes each night for sandwich assembly. Vending machine capacity is available for 2,000 sandwiches each day. The profit for a cheese
sandwich is $0.35, the profit for a bologna sandwich is $0.42, and the profit for a chicken salad sandwich is $0.37. The company knows from past sales records that its customers buy as
many cheese sandwiches as the other two sandwiches combined, if not more so, but customers need a variety of sandwiches available, so Alpujarra stocks at least 200 of each.

Question : Alpujarra management wants to know how many of each sandwich it should stock to maximize profit ? Formulate a linear programming model for this problem.

TREY 2
research
1. Alpujarra Food Services Company – Cheese Sandwich profit was increased to $0,40
Question : What would the effect be on the optimal solution if the profit for a cheese
sandwich was increased to $0.40? to $0.45? Solve the linear programming model by
using the computer?

Maximize Z = 0,40X1 + 0,42X2 + 0,37X3 Conclusion:


Subject to: By increasing the profit of Cheese Sandwich to $0,40,
0,45X1 + 0,42X2 + 0,50X3 ≤ 960 the total profit will increase by $50. The company needs
X1 + X2 + X3 ≤ 2.000 to make sandwiches with following the following
X1 - X2 - X3 ≥ 0 quantity composition:
X1, X2, X3 ≥ 200 1. 1.000 slices of Cheese Sandwich
X2 ≥ 200 2. 800 slices of Bologna Sandwich
X3 ≥ 200 3. 200 slices of Chicken Salad Sandwich
Where:
X1 = Number Stock of Cheese The profit generated is USD810
X2 = Number Stock of Bologna
X3 = Number Stock of Chicken Salad

Maximize Z = 0,40*1.000 + 0,42*800 + 0,37*200 = 810

TREY 3
research
1. Alpujarra Food Services Company – Cheese Sandwich profit was increased to $0,45
Sensitivity Analysis Case 1
Variable Cells
Final Reduced Objective Allowable Allowable Bound
Cell Name Value Cost Coefficient Increase Decrease Lower Upper Based on case 1 constraint & price variable, it can be
inferred that the maximum/upper bound for cheese
$C$16 Cheese (Unit) Coefficients 1000 0 0,35 0,07 0,77 -0,42 0,42
price unit is $0,42 therefore if the price exceeded that
$C$17 Bologna (Unit) Coefficients 800 0 0,42 1E+30 0,05 0,37 1E+30
point there will be changes is quantity of the product.
$C$18 Chicken Salad (Unit) Coefficients 200 0 0,37 0,05 1E+30 -1E+30 0,42

Conclusion:
By increasing the profit of Cheese Sandwich to $0,45,
the company needs to increase Cheese Sandwich stock
and decrease two other types of sandwich stock, with
the following quantity composition:
1. 1.600 slices of Cheese Sandwich
2. 200 slices of Bologna Sandwich
3. 200 slices of Chicken Salad Sandwich

The profit generated is USD878

TREY 4
research
2. The Comida Sana Company
The Comida Sana Company makes a feed mix from four
THE COMIDA SANA COMPANY
ingredients—oats, corn, soybeans, and a vitamin supplement.
The company has 300 pounds of oats, 400 pounds of corn, 200
Products (Variables) pounds of soybeans, and 100 pounds of vitamin supplement
Description
Oats Corn Soy Vit available for the mix.
(X1) (X2) (X3) (X4) The company has the following requirements for the mix:
Cost ($ per Feed) 0,50 1,20 0,60 2,00
1. At least 30% of the mix must be soybeans.
Resources Coefficients Usage Constraints Limit Left Over 2. At least 20% of the mix must be the vitamin
Oats 1,00 66,67 <= 300 233
3. The ratio of corn to oats cannot exceed 2 to 1
Corn 1,00 133,33 <= 400 267 4. The amount of oats cannot exceed soybeans.
Soy 1,00 200,00 <= 200 - 5. The mix must be at least 500 pounds.
Vit 1,00 100,00 <= 100 0
Soy Percentage (Ratio) (0,30) (0,30) 0,70 (0,30) 50,00 >= - 50
A pound of oats costs $0.50; a pound of corn, $1.20; a pound of
Vit Percentage (Ratio) (0,20) (0,20) (0,20) 0,80 - >= - -
Corn to Oats (Ratio) (2,00) 1,00 - = - -
soybeans, $0.60; and a pound of vitamin supplement, $2.00.
Oats and Soy (Ratio) 1,00 (1,00) (133,33) <= - 133 The feed company wants to know the number of pounds of each
Mix (Pounds) 1,00 1,00 1,00 1,00 500,00 >= 500 - ingredient to put in the mix in order to minimize cost.
Ammount Minimize
% Z =%0,50X1 + 1,20X2 + 0,60X3 + 2,00X4
Oats (Pounds) 66,67 Subject
13% to: 33,33% 1,00
Corn (Pounds) 133,33 X1
27%≤ 300 66,67% 2,00 2,00000
Soy Pounds) 200,00 X2
40%≤ 400 40,00%
Vit (Pounds) 100,00 20%≤ 200
X3 20,00%
Total 500 X4 ≤ 100
100%
Conclusion:
Cost ($) 513 -0,30X1 - 0,30X2 + 0,70X3 - 0,30X4 ≥ 0 In order to minimize cost, the mix must consist of
-0,20X1 - 0,20X2 + 0,80X3 - 0,20X4 ≥ 0 ingredients with the following quantity composition:
-2,00X1 + X2 ≤ 0 1. 66,67 pounds of oats
X1 - X3 ≤ 0 2. 133,33 pounds of Corn
X1 + X2 + X3 + X4 ≥ 500 3. 200 pounds of Soybeans
4. 100 pounds of Vitamin Supplement
Minimize Z = 0,50*66,67 + 1,2*133,33 + 0,60*200 + 2,00*100 = $513
The minimal cost is USD513

TREY 5
research
ThankYou

TREY 6
research

You might also like