Question | Answer |

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

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

above and below leading ones are zeroes | |

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

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

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

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

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

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

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

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

1-parameter solution = | |

3-or more-parameter solution = | |

Vector Sn = T^n times vector So | |

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

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

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

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

2-parameter solution = | |

system of linear equations with one or more solutions | |

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

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

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

## Show Comments