Q. 12 - Precalculus Enhanced with Graphing Utilities

Question

Solve each linear programming problem.

Minimize $z=3x+4y$ subject to $\left\{\begin{array}{l}x\ge 0\\ y\ge 0\\ 2x+3y\ge 6\\ x+y\le 8\end{array}\right.$

Step-by-Step Solution

Answer

The minimum value is $8$. We get this value at point $(0,2)$

Step 1. Given information

The given system of linear inequalities is :

$\left\{\begin{array}{l}x\ge 0\\ y\ge 0\\ 2x+3y\ge 6\\ x+y\le 8\end{array}\right.$

The goal of the task is to solve the problem of linear programming. We are looking for the smallest value that can occur if x and y are solutions of the system. We draw a graph of the system and read the corner points from the graph.

Step 2. Draw the graph of the system

Step 3. Make a table for the corner points

Corner point (x,y)	$z=3x+4y$
$(0,2)$	$z=8$
$(0,8)$	$z=32$
$(8,0)$	$z=24$
$(3,0)$	$z=9$