mws_ind_sle_txt_ludecomp_examples

# mws_ind_sle_txt_ludecomp_examples - 04.07.1 Chapter 04.07...

This preview shows pages 1–2. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 04.07.1 Chapter 04.07 LU Decomposition – More Examples Industrial Engineering Example 1 To find the number of toys a company should manufacture per day to optimally use their injection-molding machine and the assembly line, one needs to solve the following set of equations. The unknowns are the number of toys for boys, 1 x , the number of toys for girls, 2 x , and the number of unisexual toys, 3 x .           =                     − 1260 756 00 . 00 . 1 05 . 1 3333 . 6667 . 1667 . 6667 . 1667 . 3333 . 3 2 1 x x x Find the values of 1 x , 2 x , and 3 x using naïve Gauss elimination. Solution [ ] [ ][ ]                     = = 33 23 22 13 12 11 32 31 21 1 1 1 u u u u u u U L A    The [ ] U matrix is the same as the one found at the end of the forward elimination steps of the naïve Gauss elimination method....
View Full Document

## This note was uploaded on 06/12/2011 for the course EML 3041 taught by Professor Kaw,a during the Spring '08 term at University of South Florida - Tampa.

### Page1 / 4

mws_ind_sle_txt_ludecomp_examples - 04.07.1 Chapter 04.07...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online