This preview shows pages 1–2. Sign up to view the full content.
CO 227: Lecture Note Examples  Jan 4
You run an ice cream shop that serves only two ﬂavours: chocolate (
C
) and vanilla (
V
).
You also oﬀer two diﬀerent types of cones: regular (
R
) and waﬄe (
W
). Since the day is
almost done, you have only a few scoops of each ﬂavour and a few types of each cone left
over. Speciﬁcally, you have the following quantities:
ﬂavour
# of scoops
C
7
V
10
cone
# available
R
9
W
6
A tour bus arrives with many requests for single scoop cones. The customers are rather
picky and they will only buy a cone if they get exactly what they want. The requested
number of each type is:
Flavour + Cone
# ordered
V R
3
V W
3
CR
7
CW
4
Here
V R
means vanilla ice cream in a regular cone (and so on).
Your job is to fulﬁll the maximum number of orders given the limited resources you have.
Let’s model the problem as an
integer program
. Generally, in integer programs our goal is
to maximize some linear function of the variables subjected to some linear inequalities.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
 Fall '08
 Burbidge,John

Click to edit the document details