Muhammad Haikal Hafis

19016214 / MSDA

A. Linear Programming Model B. Solver Model

Country Contemporary Total
Assumed Price Decision Variables 404.4928 174.782608696
Country = X $350 Revenue Gain 350 450 220224.6
Contemporary = Z $450
Then Router 1.5 2 956.3043
Obj. Function = Z = 350x+450y Sander 3 4.5 2000
Polisher 2.5 1.5 1273.406
Constraint For Machine
Router 1.5x+2.0y <= 1000 Country Contemporary Total
Sander 3.0x+4.5y<= 2000 Country 0.8 -0.2 288.6377
Polisher 2.5x+1.5y<=1500 Contemporary -0.3 0.7 1

Constraint For Management Issue

 Since the management has been determined that
we must produce at least 20% country type and
30% of contemporary, there will be additional
constraints
Country 0.8x-0.2y.>=0
Contemporary (-0.3x)+0.7y>=0
 C. Optimal Solution
Max Capacity (Hours)

Based on the LP model that already solved by

1000 Solver we found that the optimal solution below
2000 Rounded
1500 Country 404.49 Pcs 405 Pcs
Contemporary 174.78 Pcs 174 Pcs
Greater Than
1 With Total Revenue $220,050
1