Use Linear Programming to Solve Problems
-Objective Function
Constraints
$$z = 7 x + 6 y$$
$$\begin{array} { l }
x \geq 0 \
y \geq 0 \
3 x + y \leq 21 \
x + y \leq 10 \
x + 2 y \geq 12
\end{array}$$
A) Maximum 65.5; at $( 5.5,4.5 )$
B) Maximum 60; at $( 6,3 )$
C) Maximum 68; at $( 8,2 )$
D) Maximum 66; at $( 6,4 )$

Question

Use Linear Programming to Solve Problems
-Objective Function
Constraints
$$z = 7 x + 6 y$$
$$\begin{array} { l } 
x \geq 0 \
y \geq 0 \
3 x + y \leq 21 \
x + y \leq 10 \
x + 2 y \geq 12
\end{array}$$
A) Maximum 65.5; at $( 5.5,4.5 )$
B) Maximum 60; at $( 6,3 )$
C) Maximum 68; at $( 8,2 )$
D) Maximum 66; at $( 6,4 )$

Quizplus · Accepted Answer

The correct solution involves graphing the constraints to find the feasible region and then evaluating the objective function $z = 7x + 6y$ at each vertex of this region. The maximum value of the objective function, given the constraints, is 65.5 at the point $(5.5, 4.5)$.

Use Linear Programming to Solve Problems -Objective Function Constraints z=7x+6yz = 7 x + 6 yz=7x+6y

Use Linear Programming to Solve Problems
-Objective Function
Constraints $z = 7 x + 6 y$