Question 1: Assume a large number of cardboard sheets with 23 inch width is available. From these 23 inch sheets, we nee

[answerhappygod]

Question 1 Assume A Large Number Of Cardboard Sheets With 23 Inch Width Is Available From These 23 Inch Sheets We Nee 1 (164.24 KiB) Viewed 16 times

Question 1: Assume a large number of cardboard sheets with 23 inch width is available. From these 23 inch sheets, we need to cut sheets with width 6 inch and 8 inch, in only one direction. The demand for sheets with width 6 inch is 3000, while the demand for sheets with width 8 inch is 2000. Suppose: We lose 5¢ by wasting every inch of a sheet, We incurred the cost of 1¢ for storing every extra 6” sheet, We incurred the cost of 3¢ for storing every extra 8” sheet. We would like to minimize the loss, while satisfying the demand.

Formulate the optimization model for this question: provide a list of decision variables (2 points), objective function (2 points), and constraints (2 points), sketch the feasible region (2 points), and identify the optimal solution on the graph (2 points). Hint: the objective function consists of two terms: (1) cost of wastage (2) cost of storage. Writing the first term is quite straightforward. For writing the second term, you may need to use your constraints; in fact, subtracting the right-hand side of the constraints (i.e. demand) from the left-hand side of the constraints (i.e. number of sheets (with width 6 inch or 8 inch) being cut) gives you the extra sheet being cut.

Question 2: (One-dimensional cutting stock problem) Assume a large number of cardboard sheets with 23 inch width is available. From these 23" sheets, we need to cut sheets with width 6”, 7”, and 8” in only one direction. The demand for sheets with width 6", 7", and 8" is 3000, 1000, and 2000, respectively. We would like to minimize the wastage, while satisfying the demand. 6" ייך 8" Waste 23 in Pattern 1 Pattern 2 Pattern 3 Pattern 4 Pattern 5 Pattern 6 Pattern 7 Pattern 8 Demand 3000 1000 2000