The Possibility Restaurant

Formulate a Linear Programming Model for Angela and Zooey and solve this model graphically.

Ð'јÐ"...Ð'*Ð"*Ð"ЁÐ"¤Ð'Ò'Ð"©Ð'¤Ð"--Ð"ÐŒ

Resource Availability

1200 minutes of labor per day

60 maximum meals each night

Decision variables

X1 = number of fish meal

X2 = number of beef meal

Objective function

Maximize Z = $12X1 + $16X2

Where Z = total profit per day

$12X1 = profit from fish meals

$16X2 = profit from beef meals

Resource Constraints

X1 + X2 ≤ 60 (the maximum estimated meals each night)

15X1 + 30X2 ≤ 1200 (labor in minutes to prepare meals)

2X1 - 3X2 ≥ 0 (they'll sell at least 3fish/2beef meal)

X1 - 9X2 ≤ 0 (at least10% of customers will order beef meal)

Non-Negativity Constrains

X1 ≥ 0 ; X2 ≥ 0

Complete Linear Programming Model

Maximize Z = $12X1 + $16X2