Assignment 1

Exercise 1
(a) Let n ≥ 2 be an integer, and let a, b be vectors in Rn. If a ≥ b does not hold
then either a = b or a < b.
 False. When comparing two vectors, we have to compare both the
magnitude and the direction.
(b) Let m, n ≥ 2 be integers, let A be an m-by-n matrix, and let x be an n-
dimensional vector. Then, Ax = 0 implies that either x = 0 or that A = 0.
 False. We can only conclude that the two vectors are orthogonal.
(c) Let m and n be positive integers, let A be an m-by-n matrix, and let y be a
non-zero, m-dimensional vector such that yTA = 0T. Then the rows of A are
linearly dependent.
 True. yTA = 0T indicates that the equations that M defines have no
solutions, so the matrix M does not have an inverse. This happens when
the rows of M are linearly dependent.
(d) Let m and n be positive integers, let A be an m-by-n matrix, and let y be a
non-zero, m-dimensional vector such that yTA = 0T. Then the columns of A
are linearly dependent.
 False. The columns of A are linearly dependent in this case only when
A is square.
(e) There are not 5 linearly independent columns in the following matrix:

4 9 2 11 93 - 3 9 -1
74
12 3 4 0 -6 -1 13 0 3
2 14 -6 2 0 0 -1 3 0
0 -1 3 -6 9 7 4 11 2
=

1 0 0 0 −25320 12412 6483 −11945 700

4181 4181 8362 8362 4181
0 1 0 0 23634 −11855 817 7430 377
4181 4181 4181 4181 4181
0 0 1 0 51963 −29390 3251 12345 753
4181 4181 4181 4181 4181
0 0 0 1 15771 −17597 −1298 −2731 −1080
4181 4181 4181 4181 4181

 False. As can be seen from above, the first four columns are dependent
while the last five columns are independent.
(f) Let n be a positive integer, A be an n-by-n matrix, and b, c be vectors in Rn. If
Ax = b has a unique solution, then Ax = c also has a unique solution.
 False. For example, c may be 0 and Ac = 0 may not have any solution.
(g) Suppose the rows of a matrix A are linearly dependent. Then there exists a
nonzero vector x such that Ax = 0.
  True. The fact that the rows of A are linearly dependent indicates that
the equations that A defines do not have unique solutions, which means
that for some right hand sides there are lots of solutions and for some
there are none.
(h) Suppose the system Ax =b has infinitely many solutions. Then there exists a
nonzero vector x such that Ax = 0.
 True. If Ax = b has infinitely many solutions, then the rows of A are
linearly dependent, which is equivalent to f).

Exercise 2
(a) max 350A + 190B + 400C + 300D
s.t. A + 3B + 2C + 4D ≤ 200
4A + B + 2C + D ≤ 200
A + 2B + 2C + D ≤ 200

(b) max c11 + c22 + c33 + … + cj j + cn n

s.t. a11 + a21 + a31 + … + ai1 + … + an1 ≤ b1
a21 + a22 + a32 + … + ai2 + … + an2 ≤ b2
… …
am1 + a2m + a3m + … + aij + … + anm ≤ bm

Exercise 3
Jan Feb Mar Apr May June July Aug Sep Oct Nov Dec
(x1) (x2) (x3) (x4) (x5) (x6) (x7) (x8) (x9) (x10) (x11) (x12)
Deman 10000 10000 10000 10000 30000 30000 30000 30000 30000 10000 10000 10000
d1 0 0 0
Deman 50000 50000 15000 15000 15000 15000 15000 15000 15000 50000 50000 50000
d2
Cost1 5.00 5.00 5.00 5.00 5.00 5.00 4.50 4.50 4.50 4.50 4.50 4.50
Cost2 8.00 8.00 8.00 8.00 8.00 8.00 7.00 7.00 7.00 7.00 7.00 7.00
Max 12000 12000 12000 12000 12000 12000 12000 12000 12000 12000 12000 12000
Unit 0 0 0 0 0 0 0 0 0 0 0 0
Max 15000 15000 15000 15000 15000 15000 15000 15000 15000 15000 15000 15000
Storage 0 0 0 0 0 0 0 0 0 0 0 0
Storage 0.10 0.10 0.10 0.10 0.10 0.10 0.10 0.10 0.10 0.10 0.10 0.10
Cost

min 5.0p11 + 5.0p12+ 5.0p13 + 5.0p14+ 5.0p15+ 5.0p16+ 4.5p17+ 4.5p18+ 4.5p19+
4.5p110+ 4.5p111+ 4.5p112 + 0.10 (t11 + t12 + t13 + t14 + t15 + t16 + t17 + t18 + t19 +
t110 + t111 + t112) + 8.0p21 + 8.0p22+ 8.0p23+ 8.0p24+ 8.0p25+ 8.0p26+ 7.0p27+
7.0p28+ 7.0p29+ 7.0p210+ 7.0p211+ 7.0p212 + 0.10 (t21 + t22 + t23 + t24 + t25 + t26 +
t27 + t28 + t29 + t210 + t211 + t212)

s.t. p11 + t11 = 10000 + t12

p12 + t12 = 10000 + t13
p13 + t13 = 10000 + t14
p14 + t14 = 10000 + t15
 p15 + t15 = 30000 + t16
p16 + t16 = 30000 + t17
p17 + t17 = 30000 + t18
p18 + t18 = 30000 + t19
p19 + t19 = 30000 + t110
p110 + t110 = 100000 + t111
p111 + t111 = 100000 + t112
p112 + t112 ≥ 100000
p1i ≤ 120000
t1i ≤ 75000
t1i, p1i ≥ 0

p21 + t22 = 50000 + t22

p22 + t22 = 50000 + t23
p23 + t23 = 15000 + t24
p24 + t24 = 15000 + t25
p25 + t25 = 15000 + t26
p26 + t26 = 15000 + t27
p27 + t27 = 15000 + t28
p28 + t28 = 15000 + t29
p29 + t29 = 15000 + t210
p210 + t210 = 50000 + t211
p211 + t211 = 50000 + t212
p212 + t212 ≥ 50000
p2i ≤ 120000
t2i ≤ 37500
t2i, p2i ≥ 0

Exercise 4
(a) min 300A1 + 400A2 + 300A3 + 500B1 + 200B2 +100B3 + 100C1 + 800C2
+300C3 + 500D1 + 100D2 + 500D3
s.t. A1 + A2 + A3 = 15
B1 + B2 + B3 = 15
C1 + C2 + C3 = 15
D1 + D2 + D3 = 15
A1 + B1 + C1 + D1 ≤ 10
A2 + B2 + C2 + D2 ≤ 20
A3 + B3 + C3 + D3 ≤ 30

(b) i) A1 A2 + A1 A3 + A2 A3 = 0
B1 B2 + B1 B3 + B2 B3 = 0
C1 C2 + C1 C3 + C2 C3 = 0
D1D2 + D1D3 + D2D3 = 0
ii) A1 A1T + A2 A2T + A3 A3T + B1 B1T + B2 B2T + B3 B3T + C1 C1T + C2 C2T + C3 C3T
+ D1 D1T + D2 D2T + D3 D3T ≤ 6