Question | Answer |

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

0-parameter solution = | |

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

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

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

vector u times vector v = u1v1+...+unvn | |

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

3-or more-parameter solution = | |

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

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

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

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

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

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

A basis that is also an orthonormal set | |

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

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

1-parameter solution = | |

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

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

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

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