Question | Answer |

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

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

using row operations to put a matrix into ref | |

system of linear equations with one or more solutions | |

linear system that does not have any solutions | |

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

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

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

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

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

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

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

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

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

0-parameter solution = | |

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

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

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

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

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

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

1-parameter solution = | |

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