cut - } repeat { solve Cutting_Opt; let {i in WIDTHS}...

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

View Full Document Right Arrow Icon
model cut.mod; data cut.dat; option solver cplex, solution_round 6; option display_1col 0, display_transpose -10; o problem Cutting_Opt: Cut, Number, Fill; option relax_integrality 1; o problem Pattern_Gen: Use, Reduced_Cost, Width_Limit; option relax_integrality 0; o let nPAT := 0; for {i in WIDTHS} { let nPAT := nPAT + 1; let nbr[i,nPAT] := floor (roll_width/i); let {i2 in WIDTHS: i2 <> i} nbr[i2,nPAT] := 0;
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: } repeat { solve Cutting_Opt; let {i in WIDTHS} price[i] := Fill[i].dual; solve Pattern_Gen; if Reduced_Cost &lt; -0.00001 then { let nPAT := nPAT + 1; let {i in WIDTHS} nbr[i,nPAT] := Use[i]; } else break; } display nbr, Cut; d option Cutting_Opt.relax_integrality 0; solve Cutting_Opt; display Cut;...
View Full Document

This note was uploaded on 04/01/2011 for the course CO 370 taught by Professor Henry during the Winter '11 term at Waterloo.

Ask a homework question - tutors are online