A metalworking shop needs to cut at least 37 large disks and 211 small ones from sheet metal rectangles of a standard size. Three cutting patterns are available. One yields 2 large disks with 34% waste, the second gives 5 small disks with 22% waste, and the last produces 1 large and 3 small disks with 27% waste. The shop seeks a minimum waste way to fulfill its requirements.
Formulate a linear programming model designed to choose an optimal cutting plan for the shop.
Solve the linear programming problem using the Microsoft Excel solver.