Consider the following linear programming problem:
$$\begin{array} { l }
\text { Max: } 500 A + 700 B \
\text { Subject to: } \
2 A + 3 B \leq 35 \text { (assembly hours) } \
3 A + 5 B \leq 40 \text { (machine hours) }
\end{array}$$
Reformulate and solve this problem as a goal programming problem if the following prioritized goals must be met.

Question

Consider the following linear programming problem:
 $$\begin{array} { l } 
\text { Max: } 500 A + 700 B \
\text { Subject to: } \
2 A + 3 B \leq 35 \text { (assembly hours) } \
3 A + 5 B \leq 40 \text { (machine hours) }
\end{array}$$ 
Reformulate and solve this problem as a goal programming problem if the following prioritized goals must be met.

Quizplus · Accepted Answer

The Answer of Consider the following linear programming problem:
 $$\begin{array} { l } 
\text { Max: } 500 A + 700 B \
\text { Subject to: } \
2 A + 3 B \leq 35 \text { (assembly hours) } \
3 A + 5 B \leq 40 \text { (machine hours) }
\end{array}$$ 
Reformulate and solve this problem as a goal programming problem if the following prioritized goals must be met.

Consider the Following Linear Programming Problem Reformulate and Solve This Problem as a Goal Programming Problem