Beruflich Dokumente
Kultur Dokumente
Notes
Announcements
Office Hours: (on syllabus and blackboard)
Monday 2:30pm-4:30pm in 157C (Xueyan)
Tuesday 1:00pm-3:00pm in 157E (Hui)
Wednesday 10:30am-12:30pm in 157E (Xueyan)
Thursday 2:00-4:00pm in 157D (Hui)
Friday 11:30-1:30pm in 386 (Dr. Quinn)
Office hours start this Friday. (so TAs start next week)
Registration: If you are not registered but would like to be, contact Dr.
Pat Brunese (pbrunese@purdue.edu)
Honors contracts, DRC notes, etc.: Email me for an appointment this
week else come to my office hours to speak with me.
2
Notes
Notes
Today
Model-building process
I Illustrate the process of transforming a verbal problem into a
(mathematical) optimization model
Some practical examples
Notes
Art of Modeling
Level of abstractions in model development
Notes
Notes
(objective function)
(main constraints)
(variable-type constraints)
Notes
The World needs again the secret agent 007: There is an atomic
bomb on a platform in the middle of the sea that is about to go off.
The platform is at 50m from the beach and 007 is at 100m from that
location on the beach (see figure)
There is not too much time left and 007 must reach the bomb asap
007 is a great runner (he runs at 5m/s) and swimmer (his speed in
the water is 2m/s)
Which is the best strategy to reach the bomb asap?
bomb
50m
water
007
100m
beach
8
Notes
Mathematical model
I Determine the decision variables
I Write the objective function
I Write the constraints
Notes
10
Notes
11
Notes
12
Notes
p
(100 x)2 + 502
2
(objective function)
(constraint)
(nature of the variable)
In words: compute among all the x between 0 and 100, the one that
minimizes T (x)
A bit of terminology:
I A feasible point: a choice of values for the optimization
variables (here x) that satisfies all the constraints (eg. 32.447)
I
The feasible set: the set of all feasible points (here [0, 100])
Notes
Matlab script:
x = [0 : 0.001 : 100];
x sqrt ((100 x).2 + 502)
+
;
5
2
plot(x, T );
T =
14
Notes
15
Notes
16
Notes
Alternative formulation
|x|
minimize T (x) =
+
x
5
subject to x R
p
(100 x)2 + 502
2
17
Notes
18
Notes
19
Notes
For October:
Ingredient / Beer
Malt (grams/bottle)
Hops (grams/bottle)
Labor (hours/bottle)
Profit ($/bottle)
Bugwheezer
10
20
3
1
Bug-Lite
3
12
3
2
Total available
1000
2000
1500
20
Notes
Main constraints
Variable-type constraints
21
Notes
22
Notes
23
Notes
This quantity needs to be less than 1000. This constraint can be then
written as
10W + 3L 1000
Similar constraint for hops:
20W + 12L 2000
Also, similar constraint for labor:
3W + 3L 1500
24
Notes
Integrality:
W integer
L integer
25
Notes
1W + 2L
(total profit)
10W + 3L 1000
(malt capacity)
3W + 3L 1500
(labor capacity)
(hops capacity)
W 0
(nonnegativity)
W integer
(integrality)
L0
L integer
This is an instance of integer programming
Are the following pairs (W, L) feasible ?
I (W, L) = (50, 40), (W, L) = (0, 0), (50.2, 38.1), and (0, 400) .
26
Notes
After solving this model, Ann realized that she forgot to consider the
available machine time (m.t.)
I To produce a bottle of either beer requires one hour of m.t.
I There are 4000 hours of m.t. available
I How should Ann modify the optimization model?
After solving this model, Ann receives a memo from the marketing
department regarding projected demand for October:
I
Notes
Summary
Building an optimization model:
1
Main constraints
Variable-type constraints
28
Notes
29
Notes
Sprite Communications
30
Notes
Sprite Communications
Bedrock (5,45)
Springfield (52,30)
Quahog (5,21)
Shelbyville (17,5)
31
Notes
32
Notes
33
Notes
(x 5)2 + (y 45)2 40
(x 5)2 + (y 21)2 40
(x 17)2 + (y 5)2 40
Quahog:
Shelbyville:
Springfield:
p
(x 52)2 + (y 30)2 40
34
Notes
Nonnegativity?
I
Integrality?
I
35
Notes
minimize
p
p
(x 5)2 + (y 45)2 + (x 5)2 + (y 21)2
p
p
+ (x 17)2 + (y 5)2 + (x 52)2 + (y 30)2
(total distance)
subject to
p
(x 5)2 + (y 45)2
p
(x 5)2 + (y 21)2
p
(x 17)2 + (y 5)2
p
(x 52)2 + (y 30)2
x, y R
40
40
40
40
(distance to Bedrock)
(distance to Quahog)
(distance to Shelbyville)
(distance to Springfield)
36