a. Find the general flow pattern in the network shown in the figure.

b. Assuming that the flow must be in the directions indicated, find the minimum flows in the branches denoted by \({x_2}\), \({x_3}\), \({x_4}\) and \({x_5}\).

Short Answer

Expert verified

a.The general solution of the traffic pattern of the network is \[\left\{ \begin{array}{l}{x_1} = {x_3} - 40\\{x_2} = {x_3} + 10\\{x_3}\,{\rm{is}}\,{\rm{free}}\\{x_4} = {x_6} + 50\\{x_5} = {x_6} + 60\\{x_6}\,{\rm{is}}\,{\rm{free}}\end{array} \right.\] .

b.The minimum flows of the branches \({x_2},{x_3},{x_4}\), and \({x_5}\) are \(50,40,50\), and \(60\), respectively.

Step by step solution

01

Equation at nodes

First, write down all the equations at each node. We know that the incoming flow at each node will be equal to the outgoing flow.

For node A:

\({x_2} + 30 = {x_1} + 80\)

For node B:

\({x_3} + {x_5} = {x_2} + {x_4}\)

For node C:

\({x_6} + 100 = {x_5} + 40\)

For node D:

\({x_4} + 40 = {x_6} + 90\)

For node E:

\({x_1} + 60 = {x_3} + 20\)

The total flow into the system:

\(230 = 230\)

02

Reduce the matrix

Re-arrange all the above equations to get the augmented matrix.

\(\begin{array}{c}{x_1} - {x_2} = - 50\\{x_2} - {x_3} + {x_4} - {x_5} = 0\\{x_5} - {x_6} = 60\\{x_4} - {x_6} = 50\\{x_1} - {x_3} = - 40\end{array}\)

Write down the equations in an augmented matrix form.

\(\left[ {\begin{array}{*{20}{c}}1&{ - 1}&0&0&0&0&{ - 50}\\0&1&{ - 1}&1&{ - 1}&0&0\\0&0&0&0&1&{ - 1}&{60}\\0&0&0&1&0&{ - 1}&{50}\\1&0&{ - 1}&0&0&0&{ - 40}\end{array}} \right]\)

03

Echelon matrix

Reduce the augmented matrix into an echelon matrix. Hence, the echelon matrix is:

\(\left[ {\begin{array}{*{20}{c}}1&0&{ - 1}&0&0&0&{ - 40}\\0&1&{ - 1}&0&0&0&{10}\\0&0&0&1&0&{ - 1}&{50}\\0&0&0&0&1&{ - 1}&{60}\\0&0&0&0&0&0&0\end{array}} \right]\)

04

Solution of traffic network

a.Hence, the general solution of the traffic pattern of the network is \[\left\{ \begin{array}{l}{x_1} = {x_3} - 40\\{x_2} = {x_3} + 10\\{x_3}\,{\rm{is}}\,{\rm{free}}\\{x_4} = {x_6} + 50\\{x_5} = {x_6} + 60\\{x_6}\,{\rm{is}}\,{\rm{free}}\end{array} \right..\]

a.Hence, the general solution of the traffic pattern of the network is \(\left\{ \begin{array}{l}{x_1} = {x_3} - 40\\{x_2} = {x_3} + 10\\{x_3}\,{\rm{is}}\,{\rm{free}}\\{x_4} = {x_6} + 50\\{x_5} = {x_6} + 60\\{x_6}\,{\rm{is}}\,{\rm{free}}\end{array} \right..\)

b. To get the minimum values of the branches, \({x_1}\) cannot be negative as the value of \({x_3}\)will be greater than or equal to 40.

From equation\({x_2} = {x_3} + 10\) , if \({x_3}\)is greater than or equal to 40, then the value of \({x_2}\)will be equal to or greater than 50.

Since \({x_6}\) cannot be negative, values of \({x_4}\)and \({x_5}\)will be equal to or greater than 50 and 60, respectively.

Hence, the minimum flows of the branches \({x_2},{x_3},{x_4}\), and \({x_5}\) are \(50,40,50\), and \(60\), respectively.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Suppose \({{\mathop{\rm v}\nolimits} _1},{{\mathop{\rm v}\nolimits} _2},{{\mathop{\rm v}\nolimits} _3}\) are distinct points on one line in \({\mathbb{R}^3}\). The line need not pass through the origin. Show that \(\left\{ {{{\mathop{\rm v}\nolimits} _1},{{\mathop{\rm v}\nolimits} _2},{{\mathop{\rm v}\nolimits} _3}} \right\}\) is linearly dependent.


Consider two vectors v1 andv2in R3 that are not parallel.

Which vectors inlocalid="1668167992227" 3are linear combinations ofv1andv2? Describe the set of these vectors geometrically. Include a sketch in your answer.

Question:Let A be the n x n matrix with 0's on the main diagonal, and 1's everywhere else. For an arbitrary vector bin n, solve the linear system Ax=b, expressing the components x1,.......,xnof xin terms of the components of b. See Exercise 69 for the case n=3 .

Let \(T:{\mathbb{R}^n} \to {\mathbb{R}^m}\) be a linear transformation, and suppose \(T\left( u \right) = {\mathop{\rm v}\nolimits} \). Show that \(T\left( { - u} \right) = - {\mathop{\rm v}\nolimits} \).

The solutions \(\left( {x,y,z} \right)\) of a single linear equation \(ax + by + cz = d\)

form a plane in \({\mathbb{R}^3}\) when a, b, and c are not all zero. Construct sets of three linear equations whose graphs (a) intersect in a single line, (b) intersect in a single point, and (c) have no points in common. Typical graphs are illustrated in the figure.

Three planes intersecting in a line.

(a)

Three planes intersecting in a point.

(b)

Three planes with no intersection.

(c)

Three planes with no intersection.

(c’)

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free