Scribd
Upload
44 views

Recitation 10: Thursday Nov 12 and Monday Nov 16

The document summarizes two problems related to operations management: 1) A restaurant location problem for Di Livio chain with constraints on maximum distance to locations and bundles of locations. The goal is to determine optimal locations to maximize coverage. 2) A production planning problem for Atlas Valve Company to determine the optimal mix and quantity of 5 valve products to maximize profit given constraints on production capacity, material availability and product restrictions. A mathematical model is formulated for each as an integer program.

Uploaded by

AA
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
44 views

Recitation 10: Thursday Nov 12 and Monday Nov 16

The document summarizes two problems related to operations management: 1) A restaurant location problem for Di Livio chain with constraints on maximum distance to locations and bundles of locations. The goal is to determine optimal locations to maximize coverage. 2) A production planning problem for Atlas Valve Company to determine the optimal mix and quantity of 5 valve products to maximize profit given constraints on production capacity, material availability and product restrictions. A mathematical model is formulated for each as an integer program.

Uploaded by

AA
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/ 10

Recitation 10

Thursday Nov 12th and Monday


Nov 16th
33:136:386 Operations Management

Todays Recitation
Set cover problem: Locating restaurants problem
Review for midterm problem: Atlas Valve Co

Locating
restaurants

Problem Statement
The Di Livio fancy restaurant chain is considering
opening several new restaurants in River County. There
are six potential locations: towns A, B, C, D, E and F.
Distanc
es
A
(miles)
A
0

4 10 11 14

8 10

7 12

10 3

11 8

14 10 12 7

Problem Statement
Di Livio has the following demands:
(1) To locate restaurants so that, for every inhabitant
of towns A-F, the distance to the nearest Di Livio
restaurant is at most 5 miles.
(2) The premises of town B and E must be bought from
the same owner as a bundle, so Di Livio can either
locate restaurants in both towns B and E or in neither.
(3) If a restaurant is located in town D, then another
must be located in town F.
(4) They cannot locate restaurants both in towns E and
F.
Where should be the restaurants be located to

Model formulation
xi = 1 if we locate restaurant in town I = A,B,,F; =0 otherwise
Min xA + xB + + xF
s.t.
Constraints (1):
A: xA + xC >=1
B: xB + xD >=1
C: xA + xC + xD >=1
D: xB + xC + xD + xE >=1
E: xD + xE + xF >=1
F: xE + xF >=1
Constraint (2): xB = xE
Constraint (3): xD <= xF
Constraint (4): xE + xF <= 1
Binary: xA, ., xF are binary

Atlas valve
company

Problem Statement
Atlas Valve Company makes five kinds of industrial plumbing
valves: A, B, C, D, and E:
Production Line
Product
A
B
C
D
E

Unit
Unit Raw
Manual Material
Labor
s
(Hours) (Pounds)

Unit
Profit

Setup
Time
(Hours)

Unit
Time
(Hours)

$741,00
$800,00
$620,00
$545,00
$1,025,0
0

16
10
15
8

2,00
2,40
1,50
1,25

4,00
3,00
3,00
2,30

15
20
30
12

20

3,00

3,50

40

Availabili
600 are 4000
For example,
to produce type320
A valves, 16 hours
required
ty

to set up the line, then for each type A valve produced 2.00
hours on the production line and 4.00 hours of manual labor
are necessary.

Problem Statement
Atlas sells its products to a distributor who is willing
to buy up to 100 of each kind of valve this month.

The firm has a policy that at most four different


product should be made in any given month.
Certain technical restrictions on the production
equipment dictate that if type B valves are made
this month, then type D valves cannot be made.
The goal is to maximize the profit.

Model formulation
xi = number of products of type i to be produced this month
yi = 1 if we make products of type i = A,,E ; =0 otherwise
Min 741xA + 800xB + + 1025xF
s.t.

Production line time: 16yA + +20yE + 2xA + + 3xE <=320


Manual labor time: 4xA + + 3.5xE <= 600
Raw materials:

15xA + + 4oxE <= 4000

Max production: xA <= 100yA

xE <=100yE
At most four: yA + + yE <= 4
If B then not B:
xA, , xE >=0
yA,,yE binary

yB + yD <= 1

You might also like