Finite Mathematics: Linear Equations, Matrices, and Linear Programming

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/27

flashcard set

Earn XP

Description and Tags

Vocabulary practice flashcards covering linear equations, coordinate geometry, matrix algebra, systems of linear equations, and two-dimensional linear programming based on the lecture notes.

28 Terms

1
New cards

Linear Equation in One Variable (Standard Form)

An equation that can be written in the form ax+b=0ax + b = 0, where a≠0a \neq 0.

2
New cards

Fixed Costs

Costs that do not change with the level of production.

3
New cards

Variable Costs

Costs that depend directly on the level of production.

4
New cards

Break-Even Point

The point where profit equals zero (P=0P = 0), or where total revenue equals total cost (R=CR = C).

5
New cards

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.

6
New cards

Slope of a Line

A measurement of the steepness of a line calculated as m=y2−y1x2−x1m = \frac{y_2 - y_1}{x_2 - x_1}.

7
New cards

Slope-Intercept Form

The linear equation form given by y=mx+by = mx + b, where mm represents the slope and bb represents the yy-intercept.

8
New cards

Point-Slope Form

The linear equation form given by y−y1=m(x−x1)y - y_1 = m(x - x_1), used when the slope mm and one point (x1,y1)(x_1, y_1) are known.

9
New cards

Equilibrium Point

The point where the supply and demand lines intersect, determining the equilibrium price and equilibrium quantity.

10
New cards

Consistent System

A system of linear equations that has at least one solution.

11
New cards

Inconsistent System

A system of linear equations that has no solutions.

12
New cards

Independent System

A system of linear equations that has exactly one solution.

13
New cards

Dependent System

A system of linear equations that has infinitely many solutions.

14
New cards

Parameter

A variable used in the solution of a dependent system to represent an entire family of solutions.

15
New cards

Augmented Matrix

A matrix that combines the coefficients of a system of equations with the constant terms, separated by a vertical line.

16
New cards

Reduced Row Echelon Form

A matrix form where all-zero rows are at the bottom, the leading entry in each nonzero row is 11, all other entries in a leading 11's column are zeros, and each leading 11 is to the right of the leading 11 in the row above.

17
New cards

Identity Matrix

A square matrix denoted II that contains 11s along the principal diagonal and 00s everywhere else, serving as the multiplicative identity for matrices.

18
New cards

Singular Matrix

A square matrix that does not have an inverse.

19
New cards

Boundary Line

The line formed by replacing the inequality symbol with an equal sign (Ax+By=CAx + By = C) when graphing a linear inequality in two variables.

20
New cards

Half-Planes

The two regions created on a coordinate plane when it is divided by a boundary line.

21
New cards

Feasible Region

The overlapping solution region where all inequalities in a system of linear inequalities are satisfied simultaneously.

22
New cards

Corner Point

A vertex of the feasible region formed by the intersection of two boundary lines.

23
New cards

Bounded Region

A feasible region that is completely enclosed and could fit inside a circle.

24
New cards

Unbounded Region

A feasible region that extends infinitely in at least one direction.

25
New cards

Objective Function

The linear equation (typically written as z=ax+byz = ax + by) representing the quantity that is being maximized or minimized in a linear programming problem.

26
New cards

Decision Variables

The variables (such as xx and yy) representing the controllable quantities being solved for in a linear programming model.

27
New cards

Non-Negativity Constraints

Inequalities (x≥0x \ge 0, y≥0y \ge 0) included in applied linear programming problems to prevent negative values for real-world quantities.

28
New cards

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.