Explore BrainMass
Share

# linear programming model problem

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

LAYOUT OF TABLE below is shown better in attached file... thank you

Hart Manufacturing makes three products. Each product requires manufacturing operations in three departments: A, B and C. The labor-hour requirements, by department, are:
2
Department
Product 1
Product 2
Product 2
A
1.50
3.00
2.00
B
2.00
1.00
2.50
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.
a- Formulate a linear programming model for maximizing total profit contribution. Provide the formulation.
b- ) Solve the linear program formulated in part (a) by using Excel. Include the computer output. How much of each product should be produced and what is the projected total profit contribution?
c- ) After evaluating the solution obtained in part (a), one of the production supervisors noted that production setup costs had not been taken into account. She noted that setup costs are \$400 for product 1, \$550 for product 2, and \$600 for product 3. If the solution developed in part (b) is to be used, what is the total profit after taking into account the setup costs?
d- Management realized that the optimal product mix, taking setup costs into account, might be different from the one recommended in part (b). Formulate a mixed integer linear program that takes setup cost into account. Management has also stated that we should not consider making more than 175 units of product 1, 150 of product 2, or 140 units of product 3. Provide the formulation.
e- Solve the mixed integer linear program formulated in part (d) by using Excel. Include the computer output. How much of each product should be produced and what is the projected profit? Compare this profit to that obtained in part (c).

\$2.19

## integer (linear) programming model problem

Solve the following integer (linear) programming model problem graphically by manual hand-drawn construction of the graph.

Minimize 6X + 11Y

Subject to 9X + 3Y > 27

7X + 6Y > 42

4X + 8Y > 32

X, Y > 0 and integer

a. Graph the constraints for this problem. Indicate all feasible solutions.

b. Find the optimal solution to the LP model without integer restrictions. Round up to find a feasible integer solution. Is this solution optimal?

c. Find the optimal solution for the original model as given.

View Full Posting Details