Section 1

Preview this deck

limiting factors

Front

Star 0%
Star 0%
Star 0%
Star 0%
Star 0%

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Active users

0

All-time users

0

Favorites

0

Last updated

7 years ago

Date created

Mar 1, 2020

Cards (26)

Section 1

(26 cards)

limiting factors

Front

constraints

Back

a plane in three-dimensional space

Front

Euclidean three-space

Back

sometimes called the addition method, solves a system by adding together equations to eliminate one of the variables.

Front

elimination method

Back

a system with no solution

Front

inconsistent

Back

a system that has at least one solution

Front

consistent

Back

equations that are not on the same line

Front

independent

Back

a solution region that is limited to a finite region

Front

bounded (solution region)

Back

the minimum or maximum value that you want found.

Front

optimal objective value (the goal of linear programming)

Back

displays all the points from the table of values

Front

graph

Back

a list of equations in which each equation describes the relationship between the same two variables.

Front

system of equations

Back

systematic processes that allow the system to remain equivalent to the original system of equations while changing the look of the system.

Front

elementary row operations

Back

one of the variables is eliminated by solving for a variable in one equation and substituting that value into the second equation

Front

substitution method

Back

the line of the corresponding equation is called

Front

boundary line

Back

the intersection of the inequalities in the system (Linear programming)

Front

feasible solution region

Back

Multiple two-variable inequalities form a ______________ whose solutions are those points that satisfy each inequality in the ______.

Front

system

Back

systems of linear inequalities are often used in ________________ ____________________ problems to assist in decision-making.

Front

linear programming

Back

the relationship between those two variables.

Front

equation in two variables

Back

*If an optimal objective value exists, it will always be achieved at a vertex or the the feasible solution region*

Front

KNOW!!!!

Back

an additional variable whose value will determine the values of the original variables in the ordered pairs representing the solution.

Front

parameter

Back

lines that do not intersect

Front

parallel lines; no solution

Back

lines that intersect at a single point

Front

intersecting lines; one solution

Back

the same lines

Front

coincident lines; infinite solutions

Back

a point that satisfies all the equations simultaneously

Front

solution

Back

function that is desired to minimize or maximize

Front

objective function

Back

equations on the same line

Front

dependent

Back

continuing infinitely

Front

unbounded (solution region)

Back