Question | Answer |

3-or more-parameter solution = | |

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

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

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

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

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

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

above and below leading ones are zeroes | |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

## Show Comments