Use Linear Programming to Solve Problems
-$$\begin{array} { l l }
\text { Objective Function } & z = 6 x + 7 y \
\text { Constraints } & x \geq 0 \
& y \geq 0 \
& 2 x + 3 y \leq 12 \
& 2 x + y \leq 8
\end{array}$$
A) Maximum 32; at $( 3,2 )$
B) Maximum 32; at $( 2,3 )$
C) Maximum 52; at $( 4,4 )$
D) Maximum 24; at $( 4,0 )$

Question

Use Linear Programming to Solve Problems
-$$\begin{array} { l l } 
\text { Objective Function } & z = 6 x + 7 y \
\text { Constraints } & x \geq 0 \
& y \geq 0 \
& 2 x + 3 y \leq 12 \
& 2 x + y \leq 8
\end{array}$$
A) Maximum 32; at $( 3,2 )$
B) Maximum 32; at $( 2,3 )$
C) Maximum 52; at $( 4,4 )$
D) Maximum 24; at $( 4,0 )$

Quizplus · Accepted Answer

The feasible region is bounded by the constraints. Evaluating the objective function at the vertices of the feasible region, the maximum value of 32 is achieved at the point (3,2).

Use Linear Programming to Solve Problems - A) Maximum 32; At

Use Linear Programming to Solve Problems
- A) Maximum 32; At