{"id":5286,"date":"2018-05-17T02:15:29","date_gmt":"2018-05-17T02:15:29","guid":{"rendered":"https:\/\/courses.lumenlearning.com\/coreq-collegealgebra\/?post_type=chapter&p=5286"},"modified":"2018-05-17T02:15:29","modified_gmt":"2018-05-17T02:15:29","slug":"why-solve-systems-with-matrices","status":"publish","type":"chapter","link":"https:\/\/courses.lumenlearning.com\/odessa-coreq-collegealgebra\/chapter\/why-solve-systems-with-matrices\/","title":{"raw":"Why solve systems with matrices?*","rendered":"Why solve systems with matrices?*"},"content":{"raw":"In a previous module, Polynomial and Rational Expressions, we explored a scenario in which a furniture company produces chairs and tables. \u00a0Now suppose that our company has two workshops that both produce the tables and chairs, one in Atlanta, and the other in Boston. \u00a0Furthermore, the two workshops make the furniture at different rates. \u00a0The table below shows the maximum number of chairs and tables that can be made each day at the two workshops.\r\n\r\n \r\n
\r\n\r\n\r\n\r\n\r\n\r\n
<\/td>\r\nAtlanta<\/td>\r\nBoston<\/td>\r\n<\/tr>\r\n
Chairs<\/td>\r\n20 per day<\/td>\r\n30 per day<\/td>\r\n<\/tr>\r\n
Tables<\/td>\r\n15 per day<\/td>\r\n12 per day<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<\/div>\r\n \r\n\r\nA large order comes in for 620 chairs and 360 tables. \u00a0How many days should each workshop dedicated to table and chair production in order to fulfill the order most efficiently?\r\n\r\n\"Man\r\n\r\n \r\n\r\nWhen we use the phrase most efficiently<\/em>, we mean that the workshops should be operating at full capacity with no extra production. \u00a0For example, if we allowed the Atlanta shop to produce all of the tables and chairs by itself, then after 34 days, there would be [latex]31\\times20=620[\/latex] chairs and [latex]31\\times15=465[\/latex] tables. \u00a0That would fulfill the order, but then there would be [latex]465-360=105[\/latex] extra tables cluttering up the workshop. \u00a0And if we did not make those extra 105 tables, then that would mean the workshop was not working at full capacity. \u00a0In a similar way, if the Boston workshop produced the entire order, there would either be extra furniture or inefficient use of resources there.\r\n\r\n \r\n\r\nWe expect to make use of both workshops. \u00a0But how many days should each one be utilized for table and chair production? \u00a0This calls for a system of equations! \u00a0Let [latex]A[\/latex] stand for the number of days to run the Atlanta workshop, and let [latex]B[\/latex] stand for the number of days to run the Boston workshop. \u00a0Then there will be two equations, one for chairs and one for tables:\r\n

Total chairs: \u00a0[latex]20A+30B=620[\/latex]<\/p>\r\n

Total tables: \u00a0[latex]15A+12B=360[\/latex]<\/p>\r\n \r\n\r\nOf course, using methods from the previous module, Systems of Equations and Inequalities, you can easily solve this system. \u00a0However every time a new order for chairs and tables comes in, you would have to solve a similar linear system again. \u00a0It would be better if we had a more general method that could be used to solve the system,\r\n

[latex]20A+30B=C[\/latex]\r\n[latex]15A+12B=T[\/latex]<\/p>\r\nin which [latex]C[\/latex] and [latex]T[\/latex] could be plugged in later. \u00a0Fortunately, there is a straightforward method for doing exactly that. \u00a0In this module, you will learn a new method for solving systems, one that uses a table of numbers called a matrix<\/strong> (pl. matrices<\/strong>), very much like the array of numbers from the initial table. \u00a0The coefficient matrix<\/strong> for this system is:\r\n

[latex]\\begin{bmatrix}\r\n{20} & {30} \\\\[0.3em]\r\n{15} & {12} \\\\[0.3em]<\/p>\r\n\\end{bmatrix}[\/latex]\r\n\r\nThen you can write the system as an equation of matrices, as shown below.\r\n

[latex]\\begin{bmatrix}\r\n{20} & {30} \\\\[0.3em]\r\n{15} & {12} \\\\[0.3em]<\/p>\r\n\\end{bmatrix}\r\n\\begin{bmatrix}\r\n{A} \\\\[0.3em]\r\n{B} \\\\[0.3em]\r\n\r\n\\end{bmatrix}=\\begin{bmatrix}\r\n{C} \\\\[0.3em]\r\n{T} \\\\[0.3em]\r\n\r\n\\end{bmatrix}[\/latex]\r\n\r\n \r\n\r\nThe methods for working with such an equation will be discussed shortly. \u00a0We\u2019ll revisit our thriving furniture business at the end of the module and see how matrices can be used to solve our table and chair problem once and for all.\r\n\r\n \r\n\r\n \r\n\r\n \r\n

\r\n

Learning Objectives<\/h3>\r\nMatrices and Matrix Operations\r\n
    \r\n \t
  • Find the sum and difference of two matrices<\/span><\/li>\r\n \t
  • Find scalar multiples of a matrix<\/span><\/li>\r\n \t
  • Find the product of two matrices<\/span><\/li>\r\n<\/ul>\r\n

    Gaussian Elimination<\/span><\/p>\r\n\r\n

      \r\n \t
    • Write the augmented matrix of a system of equations<\/span><\/li>\r\n \t
    • Write the system of equations from an augmented matrix<\/span><\/li>\r\n \t
    • Perform row operations on a matrix<\/span><\/li>\r\n \t
    • Solve a system of linear equations using matrices<\/span><\/li>\r\n<\/ul>\r\n

      Solve Systems with Inverses<\/span><\/p>\r\n\r\n

        \r\n \t
      • Find the inverse of a matrix<\/span><\/li>\r\n \t
      • Solve a system of linear equations using an inverse matrix<\/span><\/li>\r\n<\/ul>\r\n<\/div>\r\n ","rendered":"

        In a previous module, Polynomial and Rational Expressions, we explored a scenario in which a furniture company produces chairs and tables. \u00a0Now suppose that our company has two workshops that both produce the tables and chairs, one in Atlanta, and the other in Boston. \u00a0Furthermore, the two workshops make the furniture at different rates. \u00a0The table below shows the maximum number of chairs and tables that can be made each day at the two workshops.<\/p>\n

         <\/p>\n

        \n\n\n\n\n\n
        <\/td>\nAtlanta<\/td>\nBoston<\/td>\n<\/tr>\n
        Chairs<\/td>\n20 per day<\/td>\n30 per day<\/td>\n<\/tr>\n
        Tables<\/td>\n15 per day<\/td>\n12 per day<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

         <\/p>\n

        A large order comes in for 620 chairs and 360 tables. \u00a0How many days should each workshop dedicated to table and chair production in order to fulfill the order most efficiently?<\/p>\n

        \"Man<\/p>\n

         <\/p>\n

        When we use the phrase most efficiently<\/em>, we mean that the workshops should be operating at full capacity with no extra production. \u00a0For example, if we allowed the Atlanta shop to produce all of the tables and chairs by itself, then after 34 days, there would be [latex]31\\times20=620[\/latex] chairs and [latex]31\\times15=465[\/latex] tables. \u00a0That would fulfill the order, but then there would be [latex]465-360=105[\/latex] extra tables cluttering up the workshop. \u00a0And if we did not make those extra 105 tables, then that would mean the workshop was not working at full capacity. \u00a0In a similar way, if the Boston workshop produced the entire order, there would either be extra furniture or inefficient use of resources there.<\/p>\n

         <\/p>\n

        We expect to make use of both workshops. \u00a0But how many days should each one be utilized for table and chair production? \u00a0This calls for a system of equations! \u00a0Let [latex]A[\/latex] stand for the number of days to run the Atlanta workshop, and let [latex]B[\/latex] stand for the number of days to run the Boston workshop. \u00a0Then there will be two equations, one for chairs and one for tables:<\/p>\n

        Total chairs: \u00a0[latex]20A+30B=620[\/latex]<\/p>\n

        Total tables: \u00a0[latex]15A+12B=360[\/latex]<\/p>\n

         <\/p>\n

        Of course, using methods from the previous module, Systems of Equations and Inequalities, you can easily solve this system. \u00a0However every time a new order for chairs and tables comes in, you would have to solve a similar linear system again. \u00a0It would be better if we had a more general method that could be used to solve the system,<\/p>\n

        [latex]20A+30B=C[\/latex]
        \n[latex]15A+12B=T[\/latex]<\/p>\n

        in which [latex]C[\/latex] and [latex]T[\/latex] could be plugged in later. \u00a0Fortunately, there is a straightforward method for doing exactly that. \u00a0In this module, you will learn a new method for solving systems, one that uses a table of numbers called a matrix<\/strong> (pl. matrices<\/strong>), very much like the array of numbers from the initial table. \u00a0The coefficient matrix<\/strong> for this system is:<\/p>\n

        [latex]\\begin{bmatrix} {20} & {30} \\\\[0.3em] {15} & {12} \\\\[0.3em]<\/p>\n

        \\end{bmatrix}[\/latex]<\/p>\n

        Then you can write the system as an equation of matrices, as shown below.<\/p>\n

        [latex]\\begin{bmatrix} {20} & {30} \\\\[0.3em] {15} & {12} \\\\[0.3em]<\/p>\n

        \\end{bmatrix} \\begin{bmatrix} {A} \\\\[0.3em] {B} \\\\[0.3em] \\end{bmatrix}=\\begin{bmatrix} {C} \\\\[0.3em] {T} \\\\[0.3em] \\end{bmatrix}[\/latex]<\/p>\n

         <\/p>\n

        The methods for working with such an equation will be discussed shortly. \u00a0We\u2019ll revisit our thriving furniture business at the end of the module and see how matrices can be used to solve our table and chair problem once and for all.<\/p>\n

         <\/p>\n

         <\/p>\n

         <\/p>\n

        \n

        Learning Objectives<\/h3>\n

        Matrices and Matrix Operations<\/p>\n

          \n
        • Find the sum and difference of two matrices<\/span><\/li>\n
        • Find scalar multiples of a matrix<\/span><\/li>\n
        • Find the product of two matrices<\/span><\/li>\n<\/ul>\n

          Gaussian Elimination<\/span><\/p>\n

            \n
          • Write the augmented matrix of a system of equations<\/span><\/li>\n
          • Write the system of equations from an augmented matrix<\/span><\/li>\n
          • Perform row operations on a matrix<\/span><\/li>\n
          • Solve a system of linear equations using matrices<\/span><\/li>\n<\/ul>\n

            Solve Systems with Inverses<\/span><\/p>\n

              \n
            • Find the inverse of a matrix<\/span><\/li>\n
            • Solve a system of linear equations using an inverse matrix<\/span><\/li>\n<\/ul>\n<\/div>\n

               <\/p>\n","protected":false},"author":160,"menu_order":1,"template":"","meta":{"_candela_citation":"[]","CANDELA_OUTCOMES_GUID":"","pb_show_title":"on","pb_short_title":"","pb_subtitle":"","pb_authors":[],"pb_section_license":""},"chapter-type":[],"contributor":[],"license":[],"class_list":["post-5286","chapter","type-chapter","status-publish","hentry"],"part":994,"_links":{"self":[{"href":"https:\/\/courses.lumenlearning.com\/odessa-coreq-collegealgebra\/wp-json\/pressbooks\/v2\/chapters\/5286","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/courses.lumenlearning.com\/odessa-coreq-collegealgebra\/wp-json\/pressbooks\/v2\/chapters"}],"about":[{"href":"https:\/\/courses.lumenlearning.com\/odessa-coreq-collegealgebra\/wp-json\/wp\/v2\/types\/chapter"}],"author":[{"embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/odessa-coreq-collegealgebra\/wp-json\/wp\/v2\/users\/160"}],"version-history":[{"count":1,"href":"https:\/\/courses.lumenlearning.com\/odessa-coreq-collegealgebra\/wp-json\/pressbooks\/v2\/chapters\/5286\/revisions"}],"predecessor-version":[{"id":5287,"href":"https:\/\/courses.lumenlearning.com\/odessa-coreq-collegealgebra\/wp-json\/pressbooks\/v2\/chapters\/5286\/revisions\/5287"}],"part":[{"href":"https:\/\/courses.lumenlearning.com\/odessa-coreq-collegealgebra\/wp-json\/pressbooks\/v2\/parts\/994"}],"metadata":[{"href":"https:\/\/courses.lumenlearning.com\/odessa-coreq-collegealgebra\/wp-json\/pressbooks\/v2\/chapters\/5286\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/courses.lumenlearning.com\/odessa-coreq-collegealgebra\/wp-json\/wp\/v2\/media?parent=5286"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/odessa-coreq-collegealgebra\/wp-json\/pressbooks\/v2\/chapter-type?post=5286"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/odessa-coreq-collegealgebra\/wp-json\/wp\/v2\/contributor?post=5286"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/odessa-coreq-collegealgebra\/wp-json\/wp\/v2\/license?post=5286"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}