Linear Systems

1) In this statically determinate truss with joints as shown in Figure 1, the tension ( Fi ) in each
member can be obtained from the matrix equation below (the equation result from setting
the sum of all forces acting horizontally or vertically at each pin equal to zero).

Figure Q1

0.7071 0 0 1 0.8660 0 0 0   0 
0
0.7071 0 1 0 0.5 0 0 0   1000 
0
   
 0 1 0 0 0 1 0 0 0   0 
   
 0 0 1 0 0 0 0 0 0   0 
 0 0 0 0 0 0 1 0 0.7071  F   500 
   
 0 0 0 1 0 0 0 0 0.7071  0 
 0 0 0 0 0.8660 1 0 1 0   0 
   
 0 0 0 0 0.5 0 1 0 0   500 
 0 0 0 1 0.7071   0 
 0 0 0 0  

a) Solve the system by Gauss elimination.

b) The matrix is quite sparse, so it is a candidate for Gauss-Seidel iteration. Can it be
arranged into a diagonally dominant form? Is the system convergent for a starting vector
with all elements 0?

2) The truss in Figure Q1 is called statically determinate because nine linearly independent
equations can be established to relate the nine unknown values of the tensions in the
members. If an additional cross base is added, as sketched in Figure Q2, we have ten
unknown but still only nine equations can be written; we now have a statically
indeterminate system. Consideration of the stretching or compression of the members
permits a solution, however. We need to solve a set of equations that gives the
 displacements x of each pin, which is of the form ASA T x = P . We then gets the tensions
f by matrix multiplication: SA T x = f . The necessary matrices and vectors are

Figure Q2

0.7071 0 0 1 0.8660 0 0 0 0  0
0.7071 0 1 0 0.5 0 0 0 0  0
 
 0 1 0 0 0 1 0 0 0 0.8660 
 
 0 0 1 0 0 0 0 0 0 0.5 
A= 0 0 0 0 0 0 1 0 0.7071 0.5 
 
 0 0 0 1 0 0 0 0 0.7071 0.8660 
 0 0 0 0 0.8660 1 0 1 0 0 
 
 0 0 0 0 0.5 0 1 0 0 0 
 0 0 
 0 0 0 0 0 0 1 0.7071

S is a diagonal matrix with values (from upper left to lower right) of

4255, 6000, 6000, 3670, 3000, 3670, 6000, 6000, 4255, 3000.

(These quantities are the values of aE / L , where a is the cross-sectional area of a member, E
is the Young’s modulus for the material and L is the length.)

Solve the system of equations to determine the values of f for each of three loading vectors

P1  0 1000 0 0 500 0 0 500 0

T

P2  1000 0 0 500 0 1000 0 500 0

T

P3  0 0 0 500 0 0 0 500 0
T
3) For turbulent flow of fluids in an interconnected network (see Figure 3), the flow rate V
from one node to another is about proportional to the square root of the difference in
pressures at the nodes. (Thus fluid flow differs from flow of electrical current in a network
in that nonlinear equation result.)

Figure Q3

For the conduits sketched below, it is required to find the pressure at each node. The values
of b represent conductance factors in the relation vij  bij ( pi  p j )1/2 . These equations can

be set up for the pressures at each node:

At node 1; 0.3 500  p1  0.2 p1  p2  0.1 p1  p3

At node 2; 0.2 p1  p2  0.1 p2  p4  0.2 p2  p3

At node 3; 0.1 p1  p3  0.2 p3  p2  0.1 p3  p4

At node 4; 0.1 p2  p4  0.1 p3  p4  0.2 p4  0

Optimization

4) A television manufacturing company has to decide on the number of 27- and 20-inch
sets to be produced at one of its factories. Market research indicates that atmost 40 of
the 27-inch sets and 10 of the 20-inch sets can be sold per month. The maximum number
of work hours available is 500 per month. A 27-inch set requires 20 work hours and a
20-inch set requires 10 work hours. Each 27-inch set sold produces a profit of $120 and
each 20-inch set produces a profit of $80. A wholesaler agreed to purchase all the
television sets produced, if the numbers do not exceed the maxima indicated by the
market research.
a) Formulate a linear programming model for this problem
b) Solve this model graphically.

5) The shaded area in the following graph (Figure 4) represents the feasible region of a
linear programming problem whose objective function is to be maximized. Label each
of the following statements are true or false and then justify your answer based on the
graphical method. In each case, give an example of an objective function that illustrates
your answer.
a) If (3, 3) produces a larger value of the objective function than (0, 2) and (6, 3),
then (3, 3) must be an optimal solution.
b) If (3, 3) is an optimal solution and multiple optima solutions exist, then either
(0, 2) or (6, 3) must also be an optimal solution.
c) The point (0, 0) cannot be an optimal solution.

Figure Q4
 6) Consider the following problem.

Maximize Z  3x1  5 x2  6 x3

subject to
2 x1  x2  x3  4
x1  2x2  x3  4
x1  x2  2x3  4
x1  x2  x3  3

x1 , x2 , x3  0

Solve by the simplex method in tabular form.