Chapter 4, Problem 7P

a)

Summary Introduction

To formulate: A linear programming model.

Explanation of Solution

Formulation:

Let ‘x’ be Apple Butter.

Let ‘y’ be Applesauce.

Let ‘z’ be Apple Jelly.

$\begin{array}{c}\text{Maximize}=190x+170y+155z\\ \text{Subject to}:\\ 3.5x+5.2y+2.8z\le 500\\ 1.2x+0.8y+1.5z\le 240\\ 40x+55y+20z\le 6,500\\ x,y,z\ge 0\end{array}$

b)

Summary Introduction

To solve: The linear programming model using a computer.

Explanation of Solution

Formulation:

Let ‘x’ be Apple Butter.

Let ‘y’ be Applesauce.

Let ‘z’ be Apple Jelly.

$\begin{array}{c}\text{Maximize}=190x+170y+155z\\ \text{Subject to}:\\ 3.5x+5.2y+2.8z\le 500\\ 1.2x+0.8y+1.5z\le 240\\ 40x+55y+20z\le 6,500\\ x,y,z\ge 0\end{array}$

Model and formulas:

Solver input:

Output: