Study guides

☆☆

Q: When solving a system of linear inequalities what does the region that is never shaded represent?

Write your answer...

Submit

Still have questions?

Continue Learning about Algebra

Linear programming is just graphing a bunch of linear inequalities. Remember that when you graph inequalities, you need to shade the "good" region - pick a point that is not on the line, put it in the inequality, and the it the point makes the inequality true (like 0

A linear equation corresponds to a line, and a linear inequality corresponds to a region bounded by a line. Consider the equation y = x-5. This could be graphed as a line going through (0,-5), (1,-4), (2,-3), and so on. The inequality y > x-5 would be the region above that line.

Each inequality divides the Cartesian plane into two parts. On one side of the line the inequality is satisfied while on the other it is not. A system of inequalities divides the plane into a number of such parts and the intersection of these parts in which the inequalities are true defines the the required region.

Your question asks about "each inequalities" which is grammatically impossible since "each" implies singular whereas inequalities implies plural. Consequently it is not clear whether you mean "each inequality" or "each of a set of inequalities". In either case the set is called the feasible region, or the 2-dimensional solution set.

In 2-dimensional space, an equality could be represented by a line. A set of equalities would be represented by a set of lines. If these lines intersected at a single point, that point would be the solution to the set of equations. With inequalities, instead of a line you get a region - one side of the line representing the corresponding equality (or the other). The line, itself, may be included or excluded. Each inequality can be represented by a region and, if these regions overlap, any point within that sub-region is a solution to the system of inequalities.

Related questions

Linear programming is just graphing a bunch of linear inequalities. Remember that when you graph inequalities, you need to shade the "good" region - pick a point that is not on the line, put it in the inequality, and the it the point makes the inequality true (like 0

Each linear equation is a line that divides the coordinate plane into three regions: one "above" the line, one "below" and the line itself. For a linear inequality, the corresponding equality divides the plane into two, with the line itself belonging to one or the other region depending on the nature of the inequality. A system of linear inequalities may define a polygonal region (a simplex) that satisfies ALL the inequalities. This area, if it exists, is called the feasible region and comprises all possible solutions of the linear inequalities. In linear programming, there will be an objective function which will restrict the feasible region to a vertex or an edge of simplex. There may also be a further constraint - integer programming - where the solution must comprise integers. In this case, the feasible region will comprise all the integer grid-ponits with the simplex.

Systems of inequalities in n variables with create an n-dimensional shape in n-dimensional space which is called the feasible region. Any point inside this region will be a solution to the system of inequalities; any point outside it will not. If all the inequalities are linear then the shape will be a convex polyhedron in n-space. If any are non-linear inequalities then the solution-space will be a complicated shape. As with a system of equations, with continuous variables, there need not be any solution but there can be one or infinitely many.

A solution to a linear inequality in two variables is an ordered pair (x, y) that makes the inequality a true statement. The solution set is the set of all solutions to the inequality. The solution set to an inequality in two variables is typically a region in the xy-plane, which means that there are infinitely many solutions. Sometimes a solution set must satisfy two inequalities in a system of linear inequalities in two variables. If it does not satisfy both inequalities then it is not a solution.

A linear equation corresponds to a line, and a linear inequality corresponds to a region bounded by a line. Consider the equation y = x-5. This could be graphed as a line going through (0,-5), (1,-4), (2,-3), and so on. The inequality y > x-5 would be the region above that line.

linear in active region....

the feasible region is where two or more inequalities are shaded in the same place

If the lines intersect, then the intersection point is the solution of the system. If the lines coincide, then there are infinite number of the solutions for the system. If the lines are parallel, there is no solution for the system.

overlap

true

Each inequality divides the Cartesian plane into two parts. On one side of the line the inequality is satisfied while on the other it is not. A system of inequalities divides the plane into a number of such parts and the intersection of these parts in which the inequalities are true defines the the required region.

Your question asks about "each inequalities" which is grammatically impossible since "each" implies singular whereas inequalities implies plural. Consequently it is not clear whether you mean "each inequality" or "each of a set of inequalities". In either case the set is called the feasible region, or the 2-dimensional solution set.

People also asked