jan4 - CO 227: Lecture Note Examples - Jan 4 You run an ice...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CO 227: Lecture Note Examples - Jan 4 You run an ice cream shop that serves only two flavours: chocolate ( C ) and vanilla ( V ). You also offer two different types of cones: regular ( R ) and waffle ( W ). Since the day is almost done, you have only a few scoops of each flavour and a few types of each cone left over. Specifically, you have the following quantities: flavour # 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 fulfill 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.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

jan4 - CO 227: Lecture Note Examples - Jan 4 You run an ice...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online