click below
click below
Normal Size Small Size show me how
Math: Linear Systems
Algebra II - Sections 3.1 - 3.5
| Question | Answer |
|---|---|
| Two or more equations with the same variables. | Systems of Equations |
| A system with at least one solution. | Consistant |
| A system that has no solutions. (i.e. Parallel lines.) | Inconsistant |
| A system with exactly one solution. | Independent |
| A system with an infinite number of solutions. (i.e. When each equation in the system makes the same line.) | Dependent |
| The method of solving a system in which one equation is solved for one variable in terms of the other. | Substitution Method |
| The method of solving a system by eliminating one variable in the system by adding or subtracting the equation. | Elimination Method |
| Two or more inequalities with the same variables. | System of Inequalities |
| Conditions given to variables, often expressed as linear inequalities. | Constraints |
| The intersection of the graphs in a system of constraints. | Feasible Region |
| A regions is bounded when the graph of a system of constraints is a polygonal region. | Bounded |
| The maximum or minimum value that a linear function has for the points in a feasible region. | Vertices |
| A system of inequalities that forms a region that is open. | Unbounded |
| The process of finding the maximum or minimum values of a function for a region defined by inequalities. | Linear Programming |
| 1. The coordinates of a point in space. 2. The solution of a system of equations in three variables (x, y, and z.) | Ordered Triple |