Submitted by: Submitted by script1234
Views: 33
Words: 372
Pages: 2
Category: Business and Industry
Date Submitted: 02/24/2015 08:56 AM
PROBLEM
1
10
POINTS
20
POINTS
DECISION
VARIABLES
Xij:
whether
or
not
a
road
is
taken
OBJECTIVE
Minimize
∑
(Xij
*
Dij)
where
Dij
is
the
distance
between
location
i
and
location
j
CONSTRAINTS
Xij
≥
0
(Xij
=
BINARY
is
also
correct)
∑
X2j
=
1
AND
∑
Xi5
=
1
∑
Xik
=
∑
Xkj
where
k
≠
origin
or
final
destination
PROBLEM
2
20
POINTS
i.
20
points
(a)
DECISION
VARIABLES
Zi:
whether
or
not
to
produce
in
month
i
Xi:
how
many
units
to
produce
in
month
i
Ii:
inventory
end
of
month
i
(b)
OBJECTIVE
FUNCTION
Minimize
Cost
=
∑[(10000
*
Zi)+
(60
*
Xi)
+
(Ii
*
50)]
(c)
CONSTRAINTS
Ii
=
Ii-‐1
+
Xi
-‐
Di
(where
Di
is
the
demand
in
month
i)
Xi
≤
320*Zi
Zi
=
BINARY
Xi
≥
0
Ii
≥
0
ii.
(12
Points)
(a) X3
=
0
(b) Z2
≥
Z1
iii.
(8
points)
The
Objective
Function
will
change:
Minimize
Cost
=
∑[(10000
*
Zi)+
(80
–
0.1*(Xi
-‐
1))*Xi
+
(Ii
*
50)]
PROBLEM
3
i.
(6
points)
Optimal
Objective
Value
=
12(0)
+
10(0)
+
5(8)
+
4(8)
–
3(13)
=
$33,000
profit
ii.
(6
points)
Binding
Constraints:
Plastic,
Steel,
and...