Question | Answer |

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

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

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

A basis that is also an orthonormal set | |

linear system that does not have any solutions | |

using row operations to put a matrix into ref | |

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

1-parameter solution = | |

when one non-zero vector is a scalar multiple of another, these vectors 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 | |

0-parameter solution = | |

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

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

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

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

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

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

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

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

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

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