Assignment 7 - Length(m Required 3 23 5 34 7 20 13 29 23 35...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
MIE376S – Mathematical Programming - Assignment 7 Due: Mar 10, 2011 at the Beginning of Tutorial (2:10pm) For any questions regarding the assignment, email Nick at [email protected] Column Generation: Using the Cutting Stock Problem from Lecture/Lab, find the optimal solution to the following Cutting Stock Problem: The material comes in lengths of 100m and we have to cut it down to irregular lengths of:
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Length (m) Required 3 23 5 34 7 20 13 29 23 35 51 40 62 31 i) How many cuts were generated until an optimal solution was found? a. What is the pattern for the few cuts generated? ii) What is the optimal solution? a. How many raw materials do we need to satisfy the demand? b. How are the cuts made?...
View Full Document

This note was uploaded on 04/20/2011 for the course MIE 376 taught by Professor Daniel during the Spring '11 term at University of Toronto.

Ask a homework question - tutors are online