Question | Answer |

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

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

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

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

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

A basis that is also an orthonormal set | |

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

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

a matrix that represents the cost per dollar to run several companies/industries in an economy | |

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

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

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

A system is consistent if and only if the row rank of the coefficient matrix equals the row rank of the augmented matrix | |

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

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

3-or more-parameter solution = | |

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

using row operations to put a matrix into ref | |

1-parameter solution = | |

x vector =(x1,x2,...,xn) = Po vector + t times the v vector | |

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 | |