Question | Answer |

a matrix where all entries are non-negative and every column sums to one | |

the number of non-zero rows the matrix has after it has been put in ref | |

A basis that is also an orthonormal set | |

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

when a linear system has an infinite number of solutions it has: | |

system of linear equations with one or more solutions | |

the distance between vector u and the projection of vector u onto vector v | |

A vector space W that is part of a larger vector space V | |

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

Vector Sn = T^n times vector So | |

When vectors can be written as linear combinations of each other they are | |

using row operations to put a matrix into ref | |

If det(A) does not equal 0 then A is | |

an extra variable that's added to an inequality to make the constraint an equality | |

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

When no vector in S is a linear combination of the other vectors | |

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

above and below leading ones are zeroes | |

If given any demand there is a production schedule that meets that demand | |

when it costs less then $1 in raw materials to make $1 worth of product | |

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

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

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

## Show Comments