1/27
Vocabulary practice flashcards covering linear equations, coordinate geometry, matrix algebra, systems of linear equations, and two-dimensional linear programming based on the lecture notes.
Linear Equation in One Variable (Standard Form)
An equation that can be written in the form ax+b=0, where a=0.
Fixed Costs
Costs that do not change with the level of production.
Variable Costs
Costs that depend directly on the level of production.
Break-Even Point
The point where profit equals zero (P=0), or where total revenue equals total cost (R=C).
Fundamental Theorem of the Cartesian Coordinate System
Every point on a plane corresponds to exactly one ordered pair, and every ordered pair corresponds to exactly one point.
Slope of a Line
A measurement of the steepness of a line calculated as m=x2−x1y2−y1.
Slope-Intercept Form
The linear equation form given by y=mx+b, where m represents the slope and b represents the y-intercept.
Point-Slope Form
The linear equation form given by y−y1=m(x−x1), used when the slope m and one point (x1,y1) are known.
Equilibrium Point
The point where the supply and demand lines intersect, determining the equilibrium price and equilibrium quantity.
Consistent System
A system of linear equations that has at least one solution.
Inconsistent System
A system of linear equations that has no solutions.
Independent System
A system of linear equations that has exactly one solution.
Dependent System
A system of linear equations that has infinitely many solutions.
Parameter
A variable used in the solution of a dependent system to represent an entire family of solutions.
Augmented Matrix
A matrix that combines the coefficients of a system of equations with the constant terms, separated by a vertical line.
Reduced Row Echelon Form
A matrix form where all-zero rows are at the bottom, the leading entry in each nonzero row is 1, all other entries in a leading 1's column are zeros, and each leading 1 is to the right of the leading 1 in the row above.
Identity Matrix
A square matrix denoted I that contains 1s along the principal diagonal and 0s everywhere else, serving as the multiplicative identity for matrices.
Singular Matrix
A square matrix that does not have an inverse.
Boundary Line
The line formed by replacing the inequality symbol with an equal sign (Ax+By=C) when graphing a linear inequality in two variables.
Half-Planes
The two regions created on a coordinate plane when it is divided by a boundary line.
Feasible Region
The overlapping solution region where all inequalities in a system of linear inequalities are satisfied simultaneously.
Corner Point
A vertex of the feasible region formed by the intersection of two boundary lines.
Bounded Region
A feasible region that is completely enclosed and could fit inside a circle.
Unbounded Region
A feasible region that extends infinitely in at least one direction.
Objective Function
The linear equation (typically written as z=ax+by) representing the quantity that is being maximized or minimized in a linear programming problem.
Decision Variables
The variables (such as x and y) representing the controllable quantities being solved for in a linear programming model.
Non-Negativity Constraints
Inequalities (x≥0, y≥0) included in applied linear programming problems to prevent negative values for real-world quantities.
Fundamental Theorem of Linear Programming
A theorem stating that if an optimal value of the objective function exists, it must occur at one or more corner points of the feasible region.