Question

In a Linear Programming Program (LPP) for objective function \( Z = 14x - 10y \) subject to the constraints: \[ x + y \leq 8, \quad 3x - 2y \geq -6, \quad x, y \geq 0 \] shade the feasible region and mark the corner points in a neatly drawn graph.

Hint:

When solving a Linear Programming Problem, graph the constraints and identify the feasible region where all inequalities overlap. The objective function is then evaluated at the corner points.

Answer 1

To solve this Linear Programming Problem, we first graph the constraints to find the feasible region. 1. Graph the line \( x + y = 8 \), which is represented by the equation \( y = 8 - x \).
2. Graph the line \( 3x - 2y = -6 \), which is represented by the equation \( y = \frac{3x + 6}{2} \)
3. The inequalities \( x \geq 0 \) and \( y \geq 0 \) represent the first quadrant.
The feasible region is the area where all the inequalities overlap, which is the yellow-shaded region in the graph. The corner points (vertices) of the feasible region are the points where the lines intersect: - The point \( (0, 8) \) is where the line \( x + y = 8 \) intersects the y-axis.
- The point \( (2, 2) \) is the point where the lines \( x + y = 8 \) and \( 3x - 2y = -6 \) intersect.
- The point \( (8, 0) \) is where the line \( x + y = 8 \) intersects the x-axis.
These are the feasible corner points.
% Graph of the feasible region \includegraphics[width=0.7\textwidth]{output.png}