The graphical method is a fundamental tool for visualizing and solving systems of linear inequalities, particularly in the context of linear programming. This method leverages the geometric concept of a half-plane to represent the solution set of a single linear inequality. A half-plane is one of the two portions of a plane divided by a straight line known as the boundary line. This boundary line itself represents the solution set of the corresponding equality (e.g., (ax + by = c)). The graphical representation of an inequality's solution set is intrinsically linked to this half-plane concept. For instance, the solution set of the inequality (y > 3x) is graphically depicted as a half-plane, with the boundary line (y = 3x) shown as a dotted line because the inequality is strict and does not include the boundary points.
The nature of the boundary line is determined by the inequality's operator. If the inequality includes equality (using symbols (\leq) or (\geq)), the boundary line is part of the solution set and is represented by a solid line. Conversely, if the inequality is strict (using symbols (<) or (>)), the boundary line is excluded from the solution set and is represented by a dotted line. For example, the solution set of (y \geq 3x) includes the boundary line (y = 3x), which is drawn as a solid line. Similarly, a first-degree inequality with one variable, such as (y \leq 4), is represented by a half-plane with a horizontal boundary line, while (x > -2) uses a vertical boundary line.
In linear programming, the feasible region is the intersection of the half-planes defined by a set of constraints. Each constraint, whether (ax + by \leq c), (ax + by \geq c), (ax + by < c), or (ax + by > c), divides the plane into two half-planes. The solution space for a single constraint is one of these closed or open half-planes. A vertical line divides the plane into left and right half-planes, while a non-vertical line divides it into upper and lower half-planes. The half-plane is considered open if the inequality involves (>) or (<), and closed if it involves (\geq) or (\leq).
A standard procedure for graphing a linear inequality in two variables involves first graphing the corresponding equation (ax + by = c). The line is drawn as dashed for strict inequalities ((>) or (<)) and solid for inclusive inequalities ((\geq) or (\leq)). The solution set is then identified as the half-plane on one side of this boundary line. To determine the correct half-plane, an efficient method is to test a point not on the line, such as the origin ((0,0)). If the coordinates of this test point satisfy the inequality, the solution space is the half-plane containing the origin; otherwise, it is the opposite half-plane.
For example, to graph the solution set of (4x + 2y \leq 6), the boundary line (4x + 2y = 6) is drawn as a solid line because the inequality includes equality. The inequality sign (\leq) indicates that the solution set includes the area below the boundary line. Using a test point, such as ((-1, 2)), which lies in the shaded region, confirms the choice: substituting the coordinates gives (4(-1) + 2(2) = -4 + 4 = 0 \leq 6), which is true. This verifies that the shaded half-plane correctly represents the solution set.
The algebraic representation of a half-plane can also be determined from a graph. The steps involve finding the equation of the boundary line and then selecting the appropriate inequality sign based on the shaded region and the line's characteristics. The test point method is again useful for validation.
In the context of linear programming, the feasible region is the set of all points that satisfy all constraints simultaneously. This region is often a polygon, and the points where two boundary lines intersect are called corner points or vertices. For a prototype linear programming problem, the feasible region is the intersection of the half-planes defined by its constraints, typically represented as a shaded area in the graph.
The graphical method provides an intuitive understanding of how linear inequalities define solution spaces. It is particularly valuable for educational purposes and for solving small-scale linear programming problems, as it visually demonstrates the relationship between constraints and the feasible region. The concepts of open and closed half-planes, boundary lines, and test points are essential for accurately representing and solving systems of linear inequalities.