Shader’s problem is to determine the best possible combination of x-pods and BlueBerrys to manufacture to reach the maximum profit. This product-mix situation can be formulated as a linear programming problem.
We begin by summarizing the information needed to formulate and solve this problem (see Table B.1). Further, let’s introduce some simple notation for use in the objective function and constraints. Let:
TABLE B.1 Shader Electronics Company Problem Data
|
Hours Required to Produce One Unit
|
|
|
x-pods
|
BlueBerrys
|
|
Department
|
(X1)
|
(X2)
|
Available Hours This Week
|
Electronic
|
4
|
3
|
240
|
Assembly
|
2
|
1
|
100
|
Profit per unit
|
$7
|
$5
|
|