Book edition 5th

Author(s) Otto Bretscher

Pages 442 pages

ISBN 9780321796974

Answers without the blur.

Just sign up for free and you're in.

Short Answer

The accompanying sketch represents a maze of one-way streets in a city in the United States. The traffic volume through certain blocks during an hour has been measured. Suppose that the vehicles leaving the area during this hour were exactly the same as those entering it.
What can you say about the traffic volume at the four locations indicated by a question mark? Can you figure out exactly how much traffic there was on each block? If not, describe one possible scenario. For each of the four locations, find the highest and the lowest possible traffic volume.

The lowest possible values are 100, 120, 0, 0, and the highest possible values are 270, 250, 150 and 150.

See the step by step solution

Step by Step Solution

TABLE OF CONTENTS :

TABLE OF CONTENTS

Step 1: Consider the labeled diagram.

The sum of incoming traffic equals the sum of outgoing traffic.

Consider the diagram to create equations.

The equations are,

$\begin{matrix} 300 + a = 400 + b \\ b + c + 100 = 250 \\ d + 300 = a + 320 \\ 150 + 120 = d + c \end{matrix}$

Simplify the above equations.

$\begin{array}{l} a = 250 - c \\ b = 150 - c \\ d = 270 - c \end{array}$

Step 2: Compute the highest and lowest possible traffic volumes.

Consider the equation and substitute the values.

$\begin{array}{l} a = 250 - c \\ b = 150 - c \\ d = 270 - c \end{array}$

The lowest possible traffic volume when, $b = 0$

$\begin{array}{l} 0 = 150 - c \Rightarrow c = 150 \\ a = 250 - 150 \Rightarrow a = 100 \\ d = 270 - 150 \Rightarrow d = 120 \end{array}$

The highest possible traffic volume when, $c = 0$

$\begin{array}{l} a = 250 - 0 \Rightarrow a = 250 \\ b = 150 - 0 \Rightarrow b = 150 \\ d = 270 - 0 \Rightarrow d = 270 \end{array}$

Hence, the lowest possible values are 100, 120, 0, 0, and the highest possible values are 270, 250, 150 and 150.

Find Study Materials for

Create Study Materials

Select your language

Linear Algebra With Applications

Answers without the blur.

Short Answer

Step by Step Solution

Step 1: Consider the labeled diagram.

Step 2: Compute the highest and lowest possible traffic volumes.

Most popular questions for Math Textbooks

Want to see more solutions like these?

Recommended explanations on Math Textbooks

Select your language

Linear Algebra With Applications

Answers without the blur.

Short Answer

Step by Step Solution

Step 1: Consider the labeled diagram.

Step 2: Compute the highest and lowest possible traffic volumes.

Most popular questions for Math Textbooks

Want to see more solutions like these?

Recommended explanations on Math Textbooks

Decision Maths

Calculus

Probability and Statistics

Statistics

Mechanics Maths

Geometry

Pure Maths