Linear Programming and Integrated Circuits
A manufacturing company produces four different models of integrated circuits. Each type of circuit requires material, labor, and machine time. The optimal combination of the four types of circuits is limited by the constraints of availability for these three resources. The formulation of the linear programming production problem is:
Maximize Z = 12×1 + 10×2 + 15×3 + 11×4 (objective function for profit)
Subject to the following constraints:
Material: 5×1 + 3×2 + 4×3 + 2×4 = 240 pounds
Machine time: 6×1 + 8×2 + 2×3 + 3×4 = 240 hours
Labor: 2×1 + 3×2 + 3×3 + 2×4 = 180 hours
Nonnegativity: x1, x2, x3, x4 = 0
Where: x1 = quantity of Product 1 produced
x2 = quantity of Product 2 produced
x3 = quantity of Product 3 produced
x4 = quantity of Product 4 produced
Use Microsoft Excel and Solver to find the optimal solution for the production problem. Be sure that values selected by the computer are integers (as it doesn’t make any sense to discuss producing part of a unit of a product).