Scribd
Upload
14 views2 pages

Product Allocation Problem Solution

The document outlines a solution to the Product Allocation Problem by defining variables for production units of ten products and establishing constraints for total production and relationships between products. It includes specific constraints related to departmental hours and provides a framework for solving the system using computational tools. The final goal is to determine the optimal production quantities that satisfy all constraints and utilize departmental hours effectively.

Uploaded by

ibrogull83
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views2 pages

Product Allocation Problem Solution

The document outlines a solution to the Product Allocation Problem by defining variables for production units of ten products and establishing constraints for total production and relationships between products. It includes specific constraints related to departmental hours and provides a framework for solving the system using computational tools. The final goal is to determine the optimal production quantities that satisfy all constraints and utilize departmental hours effectively.

Uploaded by

ibrogull83
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Solution to Question 6 - Product Allocation Problem

Step 1: Define the variables.

Let x1, x2, ..., x10 represent the number of units produced of products 1 through 10 respectively.

Step 2: Write down the constraints from the problem.

Constraint 1: Total production = 10,000 units:

x1 + x2 + x3 + x4 + x5 + x6 + x7 + x8 + x9 + x10 = 10,000

Constraint 2: Product 1 = 2 * Product 4:

x1 = 2 * x4

Constraint 3: Product 6 = x4 + x8:

x6 = x4 + x8

Constraint 4: Product 10 = Product 3 + Product 2:

x10 = x2 + x3

Constraint 5: Department hour constraints (matrix form):

1*x1 + 2*x2 + 3*x3 + 2*x4 + 1*x5 + 2*x6 + 3*x7 + 1*x8 + 0*x9 + 1*x10 <= 10,000

4*x1 + 2*x2 + 2*x3 + 0*x4 + 0*x5 + 1*x6 + 0*x7 + 0*x8 + 1*x9 + 1*x10 <= 9,000

0*x1 + 0*x2 + 1*x3 + 1*x4 + 1*x5 + 0*x6 + 1*x7 + 2*x8 + 2*x9 + 1*x10 <= 11,000

0.5*x1 + 0.2*x2 + 0.1*x3 + 0.2*x4 + 0.1*x5 + 0.2*x6 + 0.5*x7 + 0.4*x8 + 0.2*x9 + 0.3*x10 <= 6,000

0.5*x1 + 0.4*x2 + 0.2*x3 + 0.1*x4 + 0.2*x5 + 0.5*x6 + 0.2*x7 + 0.2*x8 + 0.1*x9 + 0.1*x10 <= 8,000

6*x1 + 0*x2 + 0*x3 + 4*x4 + 2*x5 + 1*x6 + 1*x7 + 2*x8 + 1*x9 + 2*x10 <= 4,000

Step 3: Substitute equality constraints into inequality system.

Use the matrix inverse method or linear programming techniques to solve the system.
Step 4: Solve the system using computational tools to get values for x1 to x10.

Step 5: Verbal Summary

Calculate how many of each product to produce that satisfies all constraints and fully uses

departmental hours.

You might also like