Question | Answer |

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

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

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

using row operations to put a matrix into ref | |

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

0-parameter solution = | |

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

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

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

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

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

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

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

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

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

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

system of linear equations with one or more solutions | |

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

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

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

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

when you multiply this with a matrix it is like multiplying by one | |

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

## Show Comments