#8
DUE: Tuesday, March 13
15 points
A clothing store makes suits and blazers. Three main resources are used: material, rack space, and labor. The shop has developed this linear programming model for determining the number of suits and blazers to make in order to maximize profits:
X_{1}
= number of suits to make
X_{2}
= number of blazers to make
Z_{max}
= $100X_{1} + $150X_{2 }(profit,
$)
Subject
to:
10X_{1}
+ 4X_{2} <=160 (material,
square yds.)
X_{1}
+ X_{2} <= 20 (rack space)
10X_{1
}+ 20X_{2} <= 300
(labor, hr)
X_{1},X_{2}
>= 0
Transform
the constraints into equations.
PART
1: Solve this model with the graphical
method.


































































































































What
are the feasible solutions?
What
is the optimal solution?
PART
2: Solve this model with the Simplex
method
1^{st}
Iteration







C_{j} 
Basic Variables 
Quantity (RHS) 






























Z_{j} 






C_{j}
 Z_{j} 





Simplex
Tableau for this Model
2nd Iteration







C_{j} 
Basic Variables 
Quantity (RHS) 






























Z_{j} 






C_{j}
 Z_{j} 





3rd Iteration







C_{j} 
Basic Variables 
Quantity (RHS) 






























Z_{j} 






C_{j}
 Z_{j} 





PART 3: Solve this model with STORM.
Attach your STORM printout and your memo to management to these papers. (Don’t forget the cover sheet for your assignment.)
Include the following in your memo to management:
 problem description (why are you writing the memo)
 solution you are recommending to management. Look at all the information provided in the 3 ways you solved this problem, and report what is pertinent to management’s decision.