Question | Answer |

1-parameter solution = | |

the square root of (u1)^2+...+ (uk)^k | |

Problem of maximizing or minimizing a linear function over a set of constraints | |

choosing a point in a matrix, turning it into a one, then annihilating entries above and below it | |

the number of vectors in a basis for a vector space | |

method used to find the determinant and/or inverse of a 3x3 matrix or larger | |

the set of all linear combinations of a set of vectors | |

first nonzero entry in every row is one and below each one are zeroes | |

A^t (switching a matrix's rows and columns) | |

a basic solution to a linear program in which all variables are nonnegative | |

vector v = c1v1+c2v2+...+ckvk for some scalars c1,c2...ck | |

3-or more-parameter solution = | |

If every vector is a unit vector and the vectors are mutually orthogonal then the vectors are | |

when you multiply this with a matrix it is like multiplying by one | |

when vector u times vector v = 0, U and v vectors are: | |

Vector Sn = T^n times vector So | |

system where all constraints are 0 (when every equation in the system equals 0) | |

vector x = vector Po + t times vector v1 + s times vector v2 | |

If a set of vectors spans the vector space V and the set is linearly independent it is a | |

linear system that does not have any solutions | |

when one non-zero vector is a scalar multiple of another, these vectors are: | |

vector starting at the origin and ending at a point | |