strict inequality
Chat with our AI personalities
I think that you are asking about the linear inequalities with two variables, so my answer is related to them. First, you have to draw the boundary line (be careful, if your inequality does not contain the equal sign, the boundary line will be a dashed line, because the points on the line are not solutions to the inequality), which divide the coordinate system in two half-planes. Second, you have to test a point on either sides of the line (the best point is the origin, (0, 0), if it is not on the boundary line). If that point satisfies the inequality, then there are all its solutions, otherwise they are to the opposite side.
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 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.
If you graph the two functions defined by the two equations of the system, and their graphs are two parallel line, then the system has no solution (there is not a point of intersection).
Compound inequalities is when there is two inequality signs. You will regularly graph compound inequalities on a number line.