0% found this document useful (0 votes)
2K views15 pages

Chapter 5 - Network Modeling

The document summarizes key concepts from Chapter 5 of the Ragsdale textbook on operations network models. It discusses the transshipment problem, shortest path problem, maximal flow problems, and generalized network flow problems. It provides examples of network diagrams and problems involving these different types of operations models. It also includes notes on using Excel functions like INDEX and SUMIF for solving network problems.
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2K views15 pages

Chapter 5 - Network Modeling

The document summarizes key concepts from Chapter 5 of the Ragsdale textbook on operations network models. It discusses the transshipment problem, shortest path problem, maximal flow problems, and generalized network flow problems. It provides examples of network diagrams and problems involving these different types of operations models. It also includes notes on using Excel functions like INDEX and SUMIF for solving network problems.
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

Ragsdale, Chapter 5 Operations Network Models

5.1 The Transshipment Problem Figure 5.1

Management Science

QUAN3600

Ragsdale, Chapter 5
5.1.4

Fig 5.2

Management Science

QUAN3600

Ragsdale, Chapter 5
EXCEL Note: Using Named Range (see Formulas | Defined Names) For example, to name the range B6:B16 as Ship, simply highlight the range and type in the name in the name box (top left corner of the worksheet).

EXCEL Note: SUMIF Function arguments It is much easier in these examples if we name the ranges first.

EXCEL Note: VLOOKUP Function

Problem 6. Draw network representation.

Management Science

QUAN3600

Ragsdale, Chapter 5

Management Science

QUAN3600

Ragsdale, Chapter 5
5.2 The Shortest Path Problem

Fig 5.6

Fig 5.7

Management Science

QUAN3600

Ragsdale, Chapter 5

Problem 24.

Problem 10.

Management Science

QUAN3600

Ragsdale, Chapter 5
5.6 Maximal Flow Problems

Fig 5.22

Fig 5.23

Management Science

QUAN3600

Ragsdale, Chapter 5

Fig 5.24

Problem 27.

Management Science

QUAN3600

Ragsdale, Chapter 5 5.5 Generalized Network Flow Problems

Fig 5.16

Management Science

QUAN3600

Ragsdale, Chapter 5

10

Management Science

QUAN3600

Ragsdale, Chapter 5

Problem 25
Network Diagram

A1

1.012

A2

1.012

A3
1.012

1.012

A4

1.012

1.012

A5
1.012

A6

1.035 1.035

1.035

B1 BB -9999

1.035 1.035

B3
1.012

B5
1.012 1.035

1.012

P3 +50

1.035

P5 +50
1.058

EB +200

C1

1.058

C4

1.11

D1

11

Management Science

QUAN3600

Ragsdale, Chapter 5

12

Management Science

QUAN3600

Ragsdale, Chapter 5
Problem 29
L.B = 150 -400 P1 P1 out 18 L.B = 150 -300 P2 P2 out W1 in 21 19 W2 in L.B = 150 -600 P3 P3 out 15 17 3 W2 out 5 2 D3 100 17 D1 U.B = 500 W1 out 3 U.B = 500 6 4 D2 600 300

13

Management Science

QUAN3600

Ragsdale, Chapter 5
Case 5.2

Data Worksheet EXCEL Note: INDEX function

14

Management Science

QUAN3600

Ragsdale, Chapter 5
Max Flow (note hidden rows)

Max Profit (note hidden rows)

15

Management Science

QUAN3600

You might also like