The Minimum Cost Network Flow Problem Problem Instance: Given a - - PowerPoint PPT Presentation

▶
the minimum cost network flow problem problem instance
SMART_READER_LITE
LIVE PREVIEW

The Minimum Cost Network Flow Problem Problem Instance: Given a - - PowerPoint PPT Presentation

Dec 06, 2022 468 likes •681 views

EMIS 8374 [MCNFP Review] 1 The Minimum Cost Network Flow Problem Problem Instance: Given a network G = ( N, A ), with a cost c ij , upper bound u ij , and lower bound ij associated with each directed arc ( i, j ), and supply of, or demand

slide-1
SLIDE 1

EMIS 8374 [MCNFP Review] 1

The Minimum Cost Network Flow Problem Problem Instance: Given a network G = (N, A), with a cost cij, upper bound uij, and lower bound ℓij associated with each directed arc (i, j), and supply of,

  • r demand for, b(i) units of some commodity at each

node. Supply Nodes: b(i) > 0 Transshipment Nodes: b(i) = 0 Demand Nodes: b(i) < 0

slide-2
SLIDE 2

EMIS 8374 [MCNFP Review] 2

Linear Programming Formulation: The problem is that of finding a minimum-cost feasible flow: min

  • (i,j)∈A

cijxij subject to

  • {j:(i,j)∈A}

xij −

  • {j:(j,i)∈A}

xji = b(i) ∀i ∈ N, ℓij ≤ xij ≤ uij ∀(i, j) ∈ A Note the problem is not feasible unless the supplies and demands are balanced (i.e.,

  • i∈N b(i) = 0).
slide-3
SLIDE 3

EMIS 8374 [MCNFP Review] 3

The Circulation Problem: A MCNFP where b(i) = 0 for all nodes. The Transportation Problem: A MCNFP where

  • A bipartite network where N = N1 ∪ N2

(N1 ∩ N2 = ∅)

  • N1 are supply nodes and N2 are demand nodes
  • i ∈ N1 and j ∈ N2 for all (i, j) ∈ A

The Assignment Problem: A Transportation Problem where

  • |N1| = |N2|
  • b(i) = +1 for all i ∈ N1 and b(j) = −1 for all j ∈ N2
slide-4
SLIDE 4

EMIS 8374 [MCNFP Review] 4

The Shortest Path Problem: defined on a network with arc costs, but no capacity limits. The objective is to find a path from node s, the source, to node t, the sink, that minimizes the sum of the arc costs along the path. To formulate as MCNFP:

  • s is a suppy node with b(s) = 1.
  • t is a demand node with b(t) = −1.
  • All other nodes (N \{s, t}) are transshipment nodes.
  • ℓij = 0 and uij = 1 for all arcs.
slide-5
SLIDE 5

EMIS 8374 [MCNFP Review] 5

LP Formulation of the Shortest Path Problem min

  • (i,j)∈A

cijxij subject to

  • {j:(s,j)∈A}

xsj −

  • {j:(j,s)∈A}

xjs = 1,

  • {j:(i,j)∈A}

xij −

  • {j:(j,i)∈A}

xji = 0 ∀i ∈ N \ {s, t},

  • {j:(t,j)∈A}

xtj −

  • {j:(j,t)∈A}

xjt = −1, 0 ≤ xij ≤ 1 ∀(i, j) ∈ A.

slide-6
SLIDE 6

EMIS 8374 [MCNFP Review] 6

The Maximum Flow Problem: defined on a directed network with capacities, and no costs. In addition two nodes are specified, a source node, s, and sink node, t. The objective is the find the maximum possible flow between the source and sink while satisfying the arc capacities.

slide-7
SLIDE 7

EMIS 8374 [MCNFP Review] 7

LP Formulation of the Maximum Flow Problem max v subject to

  • {j:(s,j)∈A}

xsj −

  • {j:(j,s)∈A}

xjs = v,

  • {j:(i,j)∈A}

xij −

  • {j:(j,i)∈A}

xji = 0 ∀i ∈ N \ {s, t},

  • {j:(t,j)∈A}

xtj −

  • {j:(j,t)∈A}

xjt = −v, ℓij ≤ xij ≤ uij ∀(i, j) ∈ A. The scalar variable v is referred to as the value of the flow vector x = {xij}.

slide-8
SLIDE 8

EMIS 8374 [MCNFP Review] 8

The Max Flow Problem Formulated as MCNFP Convert the problem to an equivalent minimum cost circulation problem as follows:

  • Let cij = 0 for all (i, j) ∈ A.
  • Let b(i) = 0 for all i ∈ N.
  • Add an arc from s to t with cost cst = −1.

min −xts s.t.

  • {j:(i,j)∈A}

xij −

  • {j:(j,i)∈A}

xji = 0 ∀i ∈ N, ℓij ≤ xij ≤ uij ∀(i, j) ∈ A.

slide-9
SLIDE 9

EMIS 8374 [MCNFP Review] 9

The Texas Confectionery Company (TCC) produces three types of candy bars at two different plants.

  • Houston plant produces Rice Krunchy and Aggie bars.
  • Austin plant produces Aggie Bars and Longhorn Bars.
  • There are 160 hours of production time available per

month at each plant.

slide-10
SLIDE 10

EMIS 8374 [MCNFP Review] 10

Product Production Cost Product Time Demand Name Houston Austin (Minutes) (Units) Rice Krunchy Bar $0.04

  • 30

200 Aggie Bar $0.05 $0.06 20 280 Longhorn Bar

  • $0.06

15 320

(a) Formulate a MCNFP that TCC can solve to determine how to minimize the cost of meeting the demand for its products. Briefly describe what the elements (nodes, arcs, capacities, etc.) of your network model represent. Hint: How many hours of production time are required to meet the demand for each type of candy bar?

slide-11
SLIDE 11

EMIS 8374 [MCNFP Review] 11

(a) Nodes: H and A are supply nodes representing the Houston and Austin plants, respectively. These nodes each have a supply of 9600 minutes of production time. RK, AB and LB are demand nodes representing the demand for Rice Krunchy, Aggie and Longhorn Bars,

  • respectively. The demand at RK is 6000 minutes (30

minutes times 200 units), the demands at AB and LB are 5600 and 4800 minutes, respectively. D is a dummy node to absorb the excess supply of minutes.

slide-12
SLIDE 12

EMIS 8374 [MCNFP Review] 12

Arcs: The arc costs for (H, RK), (H, AB), (A, AB) and (A, LB) are $0.04

30 , $0.05 20 , $0.06 20

and $0.06

15 , respectively.

These arcs are uncapacitated. A unit of flow on arc (i, j) represents one minute of production time at plant i used for making bar j. The arcs from the supply nodes to the dummy node have zero cost, zero lower bound and an upper bound of 9600.

slide-13
SLIDE 13

EMIS 8374 [MCNFP Review] 13

Network for TCC Problem LB AB RK 9600 9600 A 0.004 H 0.0013 0.003

  • 6000
  • 5600
  • 4800

D

  • 2800

0.0025

slide-14
SLIDE 14

EMIS 8374 [MCNFP Review] 14

(b) Suppose that TCC wants to plan two months in advance and believes that it will need 240 Rice Krunchy Bars, 360 Aggie Bars and 480 Longhorn bars at the end

  • f next month. If there is time left over in the current

month (after the production for this month’s demand is finished), then some of these bars can be manufactured this month and held in inventory until they are needed. Extend your MCNFP from part (a) to minimize TCC’s cost for meeting the demand for its products over the next two months.

slide-15
SLIDE 15

EMIS 8374 [MCNFP Review] 15

(b) Rename nodes RK, AB and LB to RK1, AB1 and LB1 (demand in month 1) and add nodes RK2, AB2 and LB2 to represent the demand in month 2. Add nodes RKI ABI and LBI to represent the surplus production of Rice Krunchy, Aggie and Longhorn bars from month 1 that is held inventory. Rename nodes H and A to H1 and A1, respectively, and add nodes H2 and A2 to represent production in month two.

slide-16
SLIDE 16

EMIS 8374 [MCNFP Review] 16

RK2 AB2 LB2

  • 6000
  • 5600
  • 4800

RKI ABI LBI H1 A1 9600 9600 H2 D

  • 7200
  • 7200
  • 7200

AB1 LB1 RK1 9600 9600 A2

  • 400
slide-17
SLIDE 17

EMIS 8374 [MCNFP Review] 17

Arc Cost Arc Cost Arc Cost (H1, RK1)

$0.04 30

(H1, RKI)

$0.04 30

(H2, RK2)

$0.04 30

(H1, AB1)

$0.05 20

(H1, ABI)

$0.05 20

(H2, AB2)

$0.05 20

(A1, AB1)

$0.06 20

(A1, ABI)

$0.06 20

(A2, AB2)

$0.06 20

(A1, LB1)

$0.06 15

(A1, LBI)

$0.06 15

(A2, LB2)

$0.06 15

All arcs have zero lower bound and can have an infinite upper bound. Arcs not listed above have zero cost. Note that the network can be simplified as shown in the next figure.

slide-18
SLIDE 18

EMIS 8374 [MCNFP Review] 18

  • 5600
  • 4800

H1 A1 9600 9600 RK2 AB2 LB2 H2

  • 6000

RK1

  • 7200
  • 7200
  • 7200

9600 9600 A2

  • 400

D AB1 LB1

slide-19
SLIDE 19

EMIS 8374 [MCNFP Review] 19

(c) Candy bars that are stored in inventory must be kept in a special storage facility so that they do not become

  • stale. How would you extend your MCNFP from part (b)

to account for inventory holding costs of $0.02 for each Rice Krunchy Bar, $0.01 for each Aggie bar and $0.05 for each Longhorn bar?

slide-20
SLIDE 20

EMIS 8374 [MCNFP Review] 20

(c) Add the storage cost to the cost on the arcs from H1 and A2 to RK2, AB2, and LB2 Arc Cost Arc Cost (H1, RK2)

$0.04+$0.02 30

(H1, AB2)

$0.05+$0.01 20

(A1, AB2)

$0.06+$0.01 20

(A1, LB2)

$0.06+$0.05 15