This preview shows page 1. Sign up to view the full content.
AMS/MBA 546 (Fall, 2010)
Estie Arkin
Network Flows
Homework Set # 8
Due Thursday, November 18, 2010.
Suggested reading Chapters 9, 12 and Section 11.12 (Unimodularity Property) of [AMO].
1). [9.30] With respect to an optimal solution
x
∗
of a minimum cost ±ow problem, suppose that we rede²ne
arc capacities
u
′
as follows:
u
′
ij
=
b
u
ij
if
x
∗
ij
=
u
ij
∞
otherwise
Show that
x
∗
is also an optimal solution of the minimum cost ±ow problem with the arc capacities as
u
′
.
2). [12.4] The Bin Packing paroblem is as follows: There are
n
items of weight
a
1
,a
2
,...,a
n
(assume that
0
≤
a
i
≤
1). What is the minimum number of Bins each of total weight at most 1, are needed to pack all
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 01/31/2011 for the course AMS 546 taught by Professor Arkin,e during the Fall '08 term at SUNY Stony Brook.
 Fall '08
 Arkin,E

Click to edit the document details