click below
click below
Normal Size Small Size show me how
Algebra II Ch 5
Question | Answer |
---|---|
Inequality- an open sentence containing one of the symbols <,>,= and <, = and >, !=, or about = | Linear Programming Theorem- the feasible region of every linear-programming problem is convex, and the maximim or minimum quantity is determined at one of the vertices of this feasible region. |
System- is a set of conditions joined by the word and. Solution Set for a System- is the intersection of the solutuion sets for individual sentences. | |
Consistent- one or more solutions Inconsistent- a system with no real solutions. | |
Square Matrices- a matrix with the same number of rows and columns. | |
Coefficient Matrix- a matrix which represents the coefficients of the variables of a system. Constant Matrix- a matrix which represents the constants in a system of equations. | |
System-Determinetn Theorem- a 2x2 matrix system has exactly one soolution if and only if the determinent of the coefficient matrix is not zero. | |
Feasible Set/Region- set of solutions to a system of linear inequalitie. Vertices- the intersection of the boundries are called vertices of the feasible set. |