The formulation of the linear programming production problem/Management Information Sys
Linear Programming: Production Problem
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 = 12x1 + 10x2 + 15x3 + 11x4 (objective function for profit)
Subject to the following constraints:
| Material: | 5x1 + 3x2 + 4x3 + 2x4 |
| Machine time: | 6x1 + 8x2 + 2x3 + 3x4 |
| Labor: | 2x1 + 3x2 + 3x3 + 2x4 |
Submit the solution for the production problem in a Microsoft Excel worksheet with proper labeling for columns and all required calculations.
Submit your interpretations in a 1- to 2-page Microsoft Word document.
Support your responses with examples.
Cite any sources in APA format.
