# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

11 Pages

### FinalReview

Course: IE 406, Spring 2008
School: Lehigh
Rating:

Word Count: 1029

#### Document Preview

to Introduction Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling and defined the concept of a linear program. In Chapter 2, we discussed the geometry of linear programming. We showed how to solve linear programs graphically and showed that the feasible region for an LP is...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Pennsylvania >> Lehigh >> IE 406

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
to Introduction Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling and defined the concept of a linear program. In Chapter 2, we discussed the geometry of linear programming. We showed how to solve linear programs graphically and showed that the feasible region for an LP is a polyhedron. A (bounded) polyhedron is described by its vertices, or extreme points. Every linear program has an optimal solution that is an extreme point of its feasible region. In order to solve a linear program, we derived an algebraic analogue of an extreme point, called a basic feasible solution. We showed how to construct basic feasible solutions by choosing a basis matrix and solving an associated system of equations. We showed that the set of extreme points and the set of basic feasible solution are the same and that therefore, we need only consider basic feasible solutions when optimizing. IE496 Final Review 2 Course Wrap-up: Chapter 3 In Chapter 3, we first discussed optimality conditions. From a given starting point, we showed how to construct a feasible, improving direction. We derived that the reduced cost of variable j is the cost reduction that occurs from moving in the jth basic direction. We therefore derived that if no variable has negative reduced cost, then the current solution is optimal. We then derived the simplex algorithm. Moving as far as possible in the jth basic direction from a given basic feasible solution takes us to an adjacent basic feasible solution. The idea of the simplex algorithm is to move from the current BFS, along an improving basic direction, to an improved basic feasible solution. IE496 Final Review 3 Course Wrap-up: The Basis Matrix The basis matrix was a central concept in the course. understand You should How to tell if a given solution is basic. How to form the basis matrix corresponding to a given basic solution. How to compute the primal and dual solutions corresponding to a given basis. How to compute the tableau corresponding to a particular basis matrix. How to interpret all the elements of the tableau. How to tell if a given basis matrix is feasible and/or optimal. How a given basis matrix can be used to prove infeasibility or unboundedness of an LP. The role the basis matrix plays in the simplex algorithm. How to find an initial feasible basis matrix. IE496 Final Review 4 Course Wrap-up: Chapter 4 In Chapter 4, we first derived duality theory. We showed how to derive the dual problem by using Lagrangian relaxation. We showed that the dual problem provides a lower bound on the optimal value of the primal problem (weak duality). In fact, we showed that the optimal solution of the dual is the same as that of the primal (strong duality). Using duality, we derived the concept of complementary slackness and derived optimality conditions based on this concept. We interpreted these optimality conditions geometrically and related this to the Farkas Lemma. IE496 Final Review 5 Course Wrap-up: Chapter 4 (cont.) After duality theory, we derived the dual simplex method based on the idea of maintaining dual instead feasibility of primal feasibility. Note that both versions of simplex always maintain complementary slackness. Finally, we introduced the concept of extreme rays and the recession cone. We showed that every polyhedron has a unique description in terms of extreme rays and extreme points. We also showed how to characterize unbounded LPs. IE496 Final Review 6 Course Wrap-up: Chapter 5 In Chapter 5, we saw how to perform basic sensitivity analysis. We determined how to tell whether the basis remains feasible after changing problem data (locally). We determined how to tell if the basis remains feasible after adding variables and constraints. Note that all of this analysis depends only on knowing how to compute the entries of the tableau for a given basis. Finally, we looked at global dependence on the cost and right-hand side vectors and derived the parametric simplex algorithm. IE496 Final Review 7 Course Wrap-up: Chapter 6 In Chapter 6, we looked at methods for dealing with LPs that have large numbers of variables and constraints. This led to the idea of delayed column generation. Cutting plane methods, on the other hand, generate violated constraints "on the fly". These methods are critical to solving large LPs, especially in the context of integer programming. IE496 Final Review 8 Course Wrap-up: Chapter 7 In Chapter 7, we discussed network flow problems. We defined the concept of a graph and a network. We defined what a minimum cost network flow problem is and derived an analogue of the simplex algorithm for solving such problems. We showed how to improve on this algorithm with a combinatorial counterpart. We discussed some related problem and derived algorithms for solving them Assignment Problem Shortest Path Problem Minimum Spanning Tree Problem IE496 Final Review 9 Course Wrap-up: The Primal-Dual Algorithm The primal-dual algorithm can be used to solve general linear programs. Suppose we have an LP in standard form and assume without loss of generality that b 0. The idea is to start with a feasible dual solution and try to construct a primal solution that obeys complementary slackness. This is done by attempting to solve Ax = b with only the variables having zero reduced cost allowed to enter the basis. If we succeed, then the primal solution is optimal. Otherwise, we change the dual prices and continue. When applied to certain problem classes, this algorithm can be implemented very efficiently. IE496 Final Review 10 Course Wrap-up: Chapters 10 and 11 To wrap up the course, we showed how the tools we have developed can be used to solve integer programs. Certain integer programs are "easy," but these are rare. Most integer programs are difficult to solve. Rounding doesn't really help. The main algorithmic tool for solving integer programs is branch and bound. This method depends critically on the computation of lower bounds. This can be done with linear programming. The idea is to approximate the convex hull of feasible solutions to the integer program as closely as possible. This is why formulation is so important in integer programming. The formulation can be augmented by generating additional valid inequalities.
Textbooks related to the document above:
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Lehigh - ME - 242
(Fall 2002) A mixer (essentially a motor with a stirring rod or whisk) is used to mix a rather thick, but light, goop. A simple bond graph model of the system is given below. The characteristics of the motor and goop are given to the left. The whisk
Lehigh - IE - 447
Stochastic Programming and Financial Analysis IE447 Midterm ReviewDr. Ted RalphsIE447 Midterm Review1Forming a Mathematical Programming ModelThe general form of a mathematical programming model is: min f (x) s.t. g(x) 0 h(x) = 0 xX where f :
Lehigh - IE - 447
IE447: Stochastic Programming and Financial AnalysisDr. Ted Ralphs Spring 20081Miscellaneous Course InformationDr. Ted Ralphs 473 Mohler Lab 8-4784 tkr2 MW 4:00-5:00 or by appointment http:/www.lehigh.edu/~tkr2 http:/www.lehigh.edu/~tkr2/teachi
Lehigh - ME - 242
6. What is the total response to u ( t ) = 3 (1 - e -3t ) when x ( 0 ) = -.6 and x ( 0 ) = 1 .We utilize our work from previous problems to solve this problem. From Problem 1, X ( s ) =U (s) ( s + 2 ) x0 + x0 . + 2 s 2 + 2s + 5 s + 2s + 5Next us
Lehigh - ME - 242
7. Utilize the &quot;final value theorem&quot; to determine the final value of x ( t ) given the conditions of problem 6. (The solution should be the same as that obtained by taking the limit of the solution in problem 6 as t goes to infinity.) The final value
Lehigh - ME - 242
8.Consider the case where u ( t ) = cos 4t , t 0 and x ( 0 ) = 0 while x ( 0 ) = 0 . Obtain the solution for x ( t ) utilizing the phasor method. Repeat the problem but this time utilize the Laplace transform method. Is the answer the same? Should i
Lehigh - ME - 242
2. If u ( t ) = 0 , x ( 0 ) = -.6 and x ( 0 ) = 1 , what is the total time solution for x ( t ) ? From Problem 1 U (s) ( s + 2 ) x0 + x0 X (s) = 2 + 2 s + 2s + 5 s + 2s + 5 Thus: X ( s ) =( s + 2 )( -.6 ) + 1 =s + 2s + 52-.6 s - .2( s + 1) +
Lehigh - ME - 242
3. What is the response of x to a unit step in u ( t ) ? (This is the step response, h ( t ) .) For this problem take x ( 0 ) = 0 and x ( 0 ) = 0 . The Laplace Transform Table shows the pair1 n - at 1 1 . If n = 0 and a = 0 the pair degenerates to
Lehigh - ME - 242
4. What is the response of x to a unit impulse in u ( t ) ? (This is the impulse response, g ( t ) .) This solution can and should be found in two alternative ways, by taking the inverse Laplace transform of G ( s ) and by taking the time derivative
Lehigh - ME - 242
5. If u ( t ) = 3 (1 - e -3t ) and x ( 0 ) = 0 while x ( 0 ) = 0 , what is the total time solution for x ( t ) ?3 3 (Although you could use 3 G ( 0 ) - G ( -3) e -3t = - e -3t to find the particular solution, we will 5 8 use Laplace Transform me
Lehigh - IE - 406
IE406: Introduction to Mathematical Programming SyllabusDr. Ted Ralphs Fall 20071Miscellaneous Course InformationDr. Ted Ralphs 473 Mohler Lab 8-4784 tkr2 MW 4:00-5:00 or by appointment http:/www.lehigh.edu/~tkr2 http:/www.lehigh.edu/~tkr2/teac
Lehigh - ME - 242
(Spring 1999)Find the total response of the system x + 5 x = u (t ) , x ( 0 ) = -2 ,u (t )for the input shown to the right. 1 Note that G ( s ) = and that the homogeneous solution is x ( t ) = Ae -5t . s+5 0 1 Next write out an analytical form of
Lehigh - IE - 495
IE 495 Stochastic Programming Problem Set #1Due Date: February 3, 2003 Do any four of the following five problems. If you are working in pairs, do all five problems. You are allowed to examine outside sources, but you must cite any references that
Lehigh - IE - 495
Department of Industrial and Systems Engineering Spring 2003Stochastic Programming(IE 495)Meeting: Monday and Wednesday 4:105:30PM 453 Mohler LabJeff LinderothOffice: 325 Mohler Office hours: Monday and Wednesday 5:306:30PM, Thursday 24PM(also
Lehigh - IE - 418
IE 418 Integer Programming Problem Set #1Due Date: February 9 Do the following problems. You may work with one other classmate. If you work alone, you will receive a 10% bonus. You are allowed to examine outside sources, but you must cite any refer
Lehigh - IE - 418
IE 418 Integer Programming Problem Set #1 - Answers1Formulation Practice1.1 Problem Nemhauser and Wolsey Problem I.1.8.2: The BST delivery company must make deliveries to 10 customers J = {1, 2, . . . , 10} whose demands are dj for j J. A com
Lehigh - IE - 418
IE 418 Integer Programming Problem Set #2Due Date: February 23 Do the following problems. You may work with one other classmate. If you work alone, you will receive a 10% bonus. You are allowed to examine outside sources, but you must cite any refe
Lehigh - IE - 418
IE 418 Integer Programming Problem Set #2 - Answers1Nonconvex Regions1.1 Problem Consider the following polyhedra: P1 = {x R4 | 2x1 + 2x2 - x3 + 2x4 10, 4x1 + x2 - x3 + x4 10} + P2 = {x R4 | 8x1 + 2x2 - x3 + 14x4 70, x1 + x2 - x3 + x4 2}
Lehigh - IE - 418
IE 418 Integer Programming Problem Set #3Due Date: April 4 Do the following problems. You may work with one other classmate. If you work alone, you will receive a 10% bonus. You are allowed to examine outside sources, but you must cite any referenc
Lehigh - IE - 418
IE 418 Integer Programming Problem Set #4 AND Problem Set #5Due Date: April 27 Do the following problems. You may work with one other classmate. If you work alone, you will receive a 10% bonus. You are allowed to examine outside sources, but you mu
Lehigh - IE - 418
Department of Industrial and Systems Engineering Spring 2005Integer Programming(IE 418)Meeting: Monday and Wednesday 5:356:50PM 451 Mohler LabJeff LinderothOffice: 325 Mohler Office hours: Monday 89AM, Wednesday 78PM, (also by appt.) Phone: 61
Lehigh - PHYSICS - 21
Previous LectureB exerts force on moving chargesNo magnetic monopoles! Velocity selector Circular and spiral motion in a magnetic field p.Today Force on a current I Astrophysics examples Torque on a current loop DC electric motors
Lehigh - PHYSICS - 21
MagnetismB exerts force on moving charges: F =IlB dF = I dl B F = qvBMoving charges (i.e, I ) create B p.First Hour ExamExam Thurs., Oct. 4 at 4:10 pm covers Reading assignments through chapter 27 Lectures through dc motor demo (today) Home
Lehigh - PHYSICS - 21
Previous Lecture dc motor Biot-Savart LawB of a current loop p.Today Results of Exam Ampere's Law Magnetic materials p.Results of HT-1Number of Studentsmean 61 range 13-99Score p.Results of HT-1C B ANumber of Studentsm
Lehigh - IE - 495
IE 495 Stochastic Programming Problem Set #2Due Date: February 26, 2003 Do all three of the following problems. If you work alone, you will receive a 10% bonus on your score. You are allowed to examine outside sources, but you must cite any referen
Lehigh - IE - 418
IE 418: Integer Programming SyllabusDr. Ted Ralphs Spring 20071Miscellaneous Course InformationDr. Ted Ralphs 473 Mohler Lab 8-4784 tkr2 TR 5:30-6:30 or by appointment http:/www.lehigh.edu/~tkr2 http:/www.lehigh.edu/~tkr2/teaching/ie406/ TR 7:0
Lehigh - IE - 418
Sample Examination Questions IE418 Integer Programming Dr. Ralphs1. Consider a scheduling model in which a machine can be switched on at most k times during a horizon of T periods. In this model, there are two sets of variables: yt = 1 if the machi
Lehigh - PHYSICS - 31
Physics 31: Homework #1 Due Thursday, January 24, 2008 Problem A: A light source of wavelength illuminates a metal and ejects photoelectrons with a maximum kinetic energy of 1.0 eV. A second light source with half the wavelength of the first ejects
Lehigh - MATH - 205
Week 6: 3.6 Cooling/Mixing 3.9 Numerical Solutions 4.1 Higher Order DE2Problem: A 200L tank is half full of a solution containing 100g of a desolved chemical. A solution containing 0.5 g/L of the same chemical is pumped into the tank at a rate of
Lehigh - MATH - 205
Week 7: 0. 4.1 2nd Order Linear Equations 1. 4.2 Constant Coef, Homogeneous DE 2. 4.3 Undetermined Coef 3. 4.5 Springs (Homog case)2General Solution: (1) to solve the 2nd order linear DE y + a1 y + a2 y = 0 find two linearly independent solutions
Lehigh - MATH - 205
Week 7: 2. 4.3 Undetermined Coef [Tables] TABLE of trial yp : Usual trial yp F (x) ceax ceax cos(bx) or ceax sin(bx) cxk Usual yp = A0 eax yp = eax (A0 cos(bx)+ B0 sin(bx) yp = A0 + A1 x + + Ak xk ModifiedWhen: The root associated with F (x) is
Lehigh - MATH - 205
Week 8: 1. 6.1 1st order systems of DE (briefly!) 2. 5.4 Eigenvalues and Eigenvectors 3. 5.5 Eigenspaces and Diagonalization2A vector v = 0 in Rn (or in Cn ) is an eigenvector with eigenvalue of an n-by-n matrix A if Av = v. We re-write the vect
Lehigh - MATH - 205
Week 10: 1. Supplement, Part A (2nd assignment) 2. 6.1 1st order systems of DE 3. 6.2 Diagonalizable Homog Systems2Recall that Part A of the supplement had an extended discussion of a 2-by-2 non-diagonalizale example A.3, then A.5 and in final f
Lehigh - MATH - 205
Week 12: (due Tuesday, accepted Thursday) 1. 6.4 non-homog systems (text Example 1, soln #5)2Written Question 1: Overall, the instructor's use of in-class overhead slides was effective Written Question 2: Overall, the quality of printed or online
Lehigh - MATH - 205
Math 205HOMEWORK ASSIGNMENTS: (complete)Spring, 2006(TuTh schedule. Shift Thurs to Fri for MWF.) 2.5 Wronskians - 1, 4, 5, 7 3.1 Intro DE - 5, , 8, 9, 12, 22, 25 3.2 Separable Equations - 2, 3, 5, 6, 7, 13, 14 3.4 Linear Equations - 1, 2, 5, 6,
Lehigh - MATH - 205
Math 205 1. Instructor: See Staff.Policy StatementFall, 20062. Text: Peterson-Sochacki, Linear Algebra and Differential Equations. Selected portions of Chapters 1-6 will be covered, with additional material on Section 5.5 (Jordan Canonical Form
Lehigh - MATH - 205
Lehigh - MATH - 205
Math 205, Spring 2006 B. Dodson New text - Peterson-Sochacki -1. Course Info 2. Week 1 Homework: 1.1 (1st half), 1.2 Intro Due Thurs! -An m n matrix A is an array with m horizontal rows; n vertical columns i, jth entry ai,j in the ith row, and jth c
Lehigh - MATH - 205
Math 205, Spring 2006 B. Dodson Week 2: Ax = 0, homog.; Matrix Inverse. The Rank of a matrix is defined to be the number of non-zero rows in the RREF of the matrix. We do not necessarily need the RREF or even a REF to find the rank; for example, a (s
Lehigh - MATH - 205
Week 3: 1. 1.5 Determinants 2. 1.6 Properties of Dets 3. 2.1 Vector Spaces - 2 1 We compute det 4 2 9 5 5 3 using the 1(first) row expansion (by minors): det(A) = 2 2 5 4 2 4 3 3 +5 -1 9 5 9 1 1= 2(2 - 15) - (4 - 27) + 5(20 - 18) = 2(-13) - (
Lehigh - MATH - 205
Week 4: (2.1 Rn and Vector Spaces - finish) 2.2 Subspaces/Spanning 2.3 Independence/Bases 2.4 Nullspaces - 1. Vector addition; scalar multiplication in R2 . Vectors are x = (x, y), with x, y real numbers. (x1 , y1 ) + (x2 , y2 ) = (x1 + x2 , y1 + y2
Lehigh - MATH - 205
Week 5: 2.5 Wronskian 3.1 Intro, Slope Fields, verify solution 3.2 Separable DE 3.4 Linear Equations - Problem: Verify that the function y = c1 x is a y solution of y = 2x Solution: Compute y and check.1 y = c1 ( 2 )x- 2 .1 y c1 x = 2x 2x x = c
Lehigh - MATH - 205
Week 6: 3.6 Cooling/Mixing [see Cooling example, Hw 5] 3.9 Numerical Solutions [Euler, Maple's dsolve/numeric] 4.1 Higher Order DE - Problem: A 200L tank is half full of a solution containing 100g of a desolved chemical. A solution containing 0.5 g/L
Lehigh - MATH - 205
Week 7: 0. 4.1 2nd Order Linear Equations 1. 4.2 Constant Coef, Homogeneous DE 2. 4.3 Undetermined Coef 3. 4.5 Springs (Homog case) -General Solution: (1) to solve the 2nd order linear DE y + a1 y + a2 y = 0 find two linearly independent solutions y1
Lehigh - MATH - 205
Week 7a: 4.3 Undetermined Coef [Tables] TABLE of trial yp : Usual trial yp F (x) ceax ceax cos(bx) or ceax sin(bx) cxk Usual yp = A0 eax yp = eax (A0 cos(bx)+ B0 sin(bx) yp = A0 + A1 x + + Ak xk ModifiedWhen: The root associated with F (x) is NO
Lehigh - MATH - 205
Week 8: 1. 6.1 1st order systems of DE (briefly!) 2. 5.4 Eigenvalues and Eigenvectors 3. 5.5 Eigenspaces and Diagonalization - A vector v = 0 in Rn (or in Cn ) is an eigenvector with eigenvalue of an n-by-n matrix A if Av = v. We re-write the vector
Lehigh - MATH - 205
Week 10: 1. Supplement, Part A (2nd assignment) 2. 6.1 1st order systems of DE 3. 6.2 Diagonalizable Homog Systems - Recall that Part A of the supplement had an extended discussion of a 2-by-2 non-diagonalizale example A.3, then A.5 and in final for
Lehigh - MATH - 205
Math 205 Supplementc 2006, Steven H. Weintraub1Mathematics 205 SupplementA. Jordan Canonical Form In order to understand and be able to use Jordan Canonical Form, we must introduce a new concept, that of a generalized eigenvector. Definition A
Lehigh - MATH - 205
Math 205 Supplementc 2006, Steven H. Weintraub1Mathematics 205 SupplementA. Jordan Canonical Form In order to understand and be able to use Jordan Canonical Form, we must introduce a new concept, that of a generalized eigenvector. Definition A
Lehigh - MATH - 205
Summary of Some Research Findings From Early Fall 2007 Nicholas Zoller Lehigh University Let Gn,d be the nth group in the Magma/GAP database of transitive groups of degree d. Consider the minimal transitive group G24,1489 found in the list in [2]. Th
Lehigh - PHYSICS - 31
Physics 31 Spring, 2008x 3.1915 ASolution to HW #554 Find the value of the normalization constant A for the wave function = Ax exp(-x2 /2). We start with the normalization condition:Problem A The wave function of a particle is given by2(
Lehigh - PHYSICS - 21
Physics 21 Fall 2007Solution to HW-14A Wire and a Compass You are looking straight down on a magnetic compass lying flat on a table. A wire is stretched horizontally under the table, parallel to and a short distance below the compass needle. The
Lehigh - MATH - 205
Math 205, Summer II 2007 B. Dodson Week 3: 2.5 Wronskian 3.1 Intro, Slope Fields, verify solution 3.2 Separable DE 3.4 Linear Equations - Problem: Verify that the function y = c1 x is a y solution of y = 2x Solution: Compute y and check.1 y = c1 (
Lehigh - IE - 406
IE 406: Introduction to Mathematical Programming Pre-Course SurveyName: Nickname: E-mail address: _ Phone: _ Office: _ Major: Previous Institution/Major (Grad Students): Please list previous courses in mathematics, computer science, and optimization
Lehigh - ME - 242
Lehigh University Department of Mechanical Engineering and Mechanics ME 242 Mechanical Engineering Systems FINAL EXAM REVIEW PROBLEMSStart by reviewing the solution to Example 6.3 page 398 and 399. Essentially you will be getting the same solution
Lehigh - MATH - 205
Math 205, Spring 2008 B. Dodson Week 3: 1. 1.4 Special Matrices 2. 1.5 Determinants - 2 1 We compute det 4 2 9 5 5 3 using the 1(first) row expansion (by minors): det(A) = 2 2 5 4 3 4 2 3 +5 -1 9 5 9 1 1= 2(2 - 15) - (4 - 27) + 5(20 - 18) = 2
Lehigh - MATH - 205
Week 3: 1. 1.4 Special Matrices 2. 1.5 Determinants22 1 We compute det 4 2 9 55 3 using the 1(first) row expansion (by minors): det(A) = 2 2 5 3 4 3 4 2 -1 +5 1 9 1 9 5= 2(2 - 15) - (4 - 27) + 5(20 - 18) = 2(-13) - (-23) + 5(2) = -26
Lehigh - MATH - 205
Week 4: 1.6 Properties of Determinants 2.1 Rn and Vector Spaces 2.2 Subspaces/Spanning21. Vector addition; scalar multiplication in R2 . Vectors are x = (x, y), with x, y real numbers. (x1 , y1 ) + (x2 , y2 ) = (x1 + x2 , y1 + y2 ). parallelogram
Lehigh - MATH - 205
Week 5: 2.2 Subspaces/Spanning (continued) 2.3 Independence/Bases2Linear independence/Bases and Dimension Vectors v1 , v2 , . . . , vk in a vector space V are linearly dependent if there are scalars c1 , c2 , . . . , ck so 0 = c1 v1 + c2 v2 +
Lehigh - MATH - 205
Week 6, 7: 2.5 Wronskian 3.1 Intro, Slope Fields, verify solution 3.2 Separable DE 3.3 Exact Equations 3.4 Linear Equations 3.6 Cooling/Mixing2Problem 1: Verify that the function y = c1 x is a y solution of y = 2x Solution: Compute y and check.1
Lehigh - MATH - 205
Math 205, Spring 2008 B. Dodson Text - Peterson-Sochacki Office hours: M,W: 10:20-11:20, Tu: 11:30 - 12:30 and by appt. email: bad0@lehigh.edu -1. Course Info 2. Homework 1: 1.1: 1-6, 17, 18, 21 Due Friday -An m n matrix A is an array with m horizon