1 / 42

3. Linear Programming

3. Linear Programming. 3.1 Linear Algebra. Square n-by-n Matrix. Solution of Simultaneous Linear Equations. Cramer’s Theorem (Solution of Linear Systems by Determinants) If a linear system of n equations in the same number of unknowns x 1 , … , x n

wrighteva
Download Presentation

3. Linear Programming

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. 3. Linear Programming 3.1 Linear Algebra

  2. Square n-by-n Matrix

  3. Solution of Simultaneous Linear Equations

  4. Cramer’s Theorem (Solution of Linear Systems by Determinants) If a linear system of n equations in the same number of unknowns x1, … , xn has a nonzero coefficient determinant D = det A, the system has precisely one solution. This solution is given by the formulas where Dk is the determinant obtained from D by replacing in D the kth column by the column with the entries b1, … , bn.

  5. Forward Elimination 2 u + v + w = 1 (1) 4 u + v = -2 (2) -2 u + 2 v + w = 7 (3) Step 1: equation (2) +(– 2) x equation (1) Step 2: equation (3) + (+1) x equation (1) 2 u + v + w = 1 (4) (-1) v - 2 w = - 4 (5) 3 v + 2 w = 8 (6) Step 3: equation (6) + (+3) x equation (5) 2 u + v + w = 1 (7) - v - 2 w = -4 (8) - 4 w = -4 (9) Backward Substitution w = 1 v = 2 u = -1 Gaussian Elimination pivot pivot

  6. Elementary Transformation of Matrices – (i)

  7. Elementary Transformation of Matrices – (ii)

  8. Elementary Transformation of Matrices – (iii)

  9. Elementary Row Operation Any row manipulation can be accomplished by pre-multiplication of elementary matrices!

  10. Elementary Column Operation Any column manipulation can be accomplished by post-multiplication of elementary matrices!

  11. Gaussian Elimination = Triangular Factorization

  12. Upper triangular Lower triangular

  13. Conclusions

  14. Implications

  15. Row Exchange

  16. Elimination with Row Exchange

  17. Round Off Error

  18. Singular matrix

  19. Second Point: Even a well-conditioned matrix can be ruined by a poor algorithm.

  20. If a calculator is capable of keeping only 3 digits, then Gaussian elimination gives the wrong answer!!! 0

  21. Third Point A computer program should compare each pivot with all the other possible pivots in the same column. Choosing the largest of these candidates, and exchanging the corresponding rows so as to make this largest value pivot, is called partial pivoting.

  22. Solution of m Equations with n Unknowns (m<n) – Example 1 pivot pivot

  23. Echelon Form

  24. Solution of m Equations with n Unknowns (m<n) – Example 2 pivot

  25. CONCLUSION To any m-by-n matrix A there corresponds • a square (i.e., m-by-m) permutation matrix R, • a square (i.e., m-by-m) lower triangular matrix L with unit diagonal, and • an m-by-nechelon matrix U, such that RA = LU

  26. Homogeneous Solution for Example 1 pivot

  27. Subspace A subspace of a vector spaceis a subset that satisfies two requirements: • If we add any two vectors x and y in the subspace, the sum x+y is still in the subspace. • If we multiply any vector x in the subspace by any scalar c, the multiple cx is still in the subspace. Note that the zero vector belongs to every subspace.

  28. Conclusions • Every homogeneous system Ax=0, if it has more unknowns than equations (n>m), has infinitely many nontrivial solutions. • The dimension of nullspace is the number of free variables (which is larger than than or equal to n-m>0). • The nullspace is a subspace of Rⁿ.

  29. Inhomogeneous Solution of Example 1

  30. Conclusion The system Ax=b is solvable if and only if the vector b can be expressed as a linear combination of the columns of A, i.e.

  31. Conclusions

  32. homogeneous solution Ax=0 particular soln

  33. CONCLUSIONS • Suppose the m-by-n matrix A is reduced by elementary operations and rowexchanges to a matrix U in echelon form. • Let there be r nonzero pivots; the last m-r rows of U are zero. Then there will be rbasic variables and n-rfree variables, corresponding to the columns of U with and without pivots respectively. • Note that

  34. CONCLUSIONS • The nullspace, formed of solutions to Ax=0, has the n-r free variables as the independent parameters, i.e., its dimension is also n-r. If r=n ( ), there are no free variables and the null space contains only x=0. • Solution always exists for every right side b iff r=m<n. In this case, since U has no zero rows, Ux=c can be solved by back-substitution.

  35. CONCLUSIONS • If r<m<n, then U will have m-rzero rows and there are m-r constraints on b in order for Ax=b to be solvable. If the particular solution exists, then every other solution differs from it by a vector in the nullspace of A. • The number r is called the rank of the matrix A.

More Related