MAT 540 QuantitativeMethodsWeek7

.  Formulate and solve linear programming model.

 

Letting:           x1 = pizza slices

x2 = hot dogs

x3 = BBQ sandwiches

 

Model is for the 1st home game.

 

Objective is to maximize total profit.

 

            Maximize        Z = $0.75x1 + $1.05x2 + $1.35x3

           

            Subject to the following constraints:

 

                        Budget:           $0.75x1 + $0.45x2 + $0.90x3 ≤ $1,500

                        Space:              24x1 + 16x2 + 25x3 ≤ 55,296 sq. inch of oven space

                                               

x1 – x2 – x3 ≥ 0 (at least as many slices of pizza as hot dogs and

                            barbeque sandwiches combined)

 

x2 – 2x3 ≥ 0  (at least twice as many hot dogs as barbeque

                      sandwiches)

 

x1, x2, x3 ≥ 0 (non-negativity constraint)

 
Powered by