Go on. Explore!

lvl 0 • 0 xp

lvl 1

Home Market Decks Interests

Algebra

memorize.ai (lvl 286)

(0)

14 cards

()

Section 1

Preview this deck

systems of equations

Front

1 / 14

Algebra Math

0.0

0 reviews

5			0
4			0
3			0
2			0
1			0

Active users

All-time users

Favorites

Last updated

6 years ago

Date created

Mar 14, 2020

Cards (14)

Section 1

(14 cards)

systems of equations

Front

A system of equations is a collection of two or more equations with a same set of unknowns. In solving a system of equations, we try to find values for each of the unknowns that will satisfy every equation in the system. The equations in the system can be linear or non-linear.

Back

same line - inf sol

Front

both lines are the same and go on forever therefore inf sol

Back

feasible region

Front

A feasible region is an area defined by a set of coordinates that satisfy a system of inequalities. The region satisfies all restrictions imposed by a linear programming scenario. The concept is an optimization technique.

Back

ordered triple

Front

n mathematics, an ordered pair (a, b) is a pair of objects. ... The entries of an ordered pair can be other ordered pairs, enabling the recursive definition of ordered n-tuples (ordered lists of n objects). For example, the ordered triple (a,b,c) can be defined as (a, (b,c)), i.e., as one pair nested in another.

Back

systems of linear inequalities

Front

The solution of a linear inequality is the ordered pair that is a solution to all inequalities in the system and the graph of the linear inequality is the graph of all solutions of the system. Graph one line at the time in the same coordinate plane and shade the half-plane that satisfies the inequality.

Back

constraints

Front

In mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. There are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. The set of candidate solutions that satisfy all constraints is called the feasible set.

Back

parallel lines - no solution

Front

lines do not int therefore no solution

Back

substitution method

Front

Substitution method is a method of solving a system of equations wherein one of the equations is solved for one variable in terms of the other variables.

Back

bounded region

Front

In mathematics, a function defined on a region of the complex plane is said to be of bounded type if it is equal to the ratio of two analytic functions bounded in that region. But more generally, a function is of bounded type in a region if and only if f {\displaystyle f} is analytic on and log + ⁡

Back

linear programming

Front

a mathematical technique for maximizing or minimizing a linear function of several variables, such as output or cost.

Back

graphing method

Front

the Graphing Method. Definition A linear system of equations is a set of two (or more) linear equations containing the same variables. A solution to a linear system is a point (a, b) that satisfies all the equations in the system.

Back

elimination method

Front

The elimination method for solving linear systems. Another way of solving a linear system is to use the elimination method. In the elimination method you either add or subtract the equations to get an equation in one variable.

Back

int lines - 1 sol

Front

lines int at one point and one point only therefore 1 solution

Back

unbounded region

Front

Feasible sets may be bounded or unbounded. For example, the feasible set defined by the constraint set {x ≥ 0, y ≥ 0} is unbounded because in some directions there is no limit on how far one can go and still be in the feasible region.

Back