MATH 340 Lecture Notes - Lecture 2: Negative Number, 32X, Linear Algebra
Document Summary
We had a couple of examples last class, so now we have an idea of what a linear program is. General setup: going back to linear algebra, a linear function on n variables (usually we"ll denote them x1, . , xn) is any function of the form n f (x1, . , xn) = a1x1 + a2x2 + + anxn = akxk. X k=0 for some real numbers a1, . , an (so f1(x1, x2, x3) = 2x1 + x2 x3 and f2(x1, x2) = 4. 5x2 are two examples in three variables - in the latter example x1 is still a variable but just has coe cient 0). A linear constraint on our variables is an expression that looks like one of the following things, for a linear function f (x1, . , xn) and a constant c: f (x1, .
