Question | Answer |

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

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

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

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

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

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

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

2-parameter solution = | |

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

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

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

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

vector of length one | |

using row operations to put a matrix into ref | |

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

Vector Sn = T^n times vector So | |

If AB = I and BA = I then B is the _______ of A. | |

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

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

A basis that is also an orthonormal set | |

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