Maximizing total profit contribution for hart manufacturing


Problem:

Linear Programming: Hart Manufacturing

Hart Manufacturing makes three products. Each product requires manufacturing operations in three departments: A, B, and C. The labor-hour requirements, by department, are as follows:

Department Product 1 Product 2 Product 3

A 1.5 3 2
B 2 1 2.5
C 0.25 0.25 0.25

During the next production period, the labor-hours available are 450 in department A, 350 in department B, and 50 in department C. The profit contributions per unit are $25 for product 1, $28 for product 2, and $30 for product 3.

Formulate a linear programming model for maximizing total profit contribution. Answer the questions in the attached case.

Attachment:- Algorithmic.rar

Solution Preview :

Prepared by a verified Expert
Mathematics: Maximizing total profit contribution for hart manufacturing
Reference No:- TGS01918502

Now Priced at $20 (50% Discount)

Recommended (90%)

Rated (4.3/5)