| |||||||||
Cut generation for an economic lot-sizing (ELS) problem Description This model implements various forms of cut-and-branch and branch-and-cut algorithms. In its simplest form (looping over LP solving) it illustrates the following
features:
Another implementation (main model: runels.mos, submodel: elsp.mos) parallelizes the execution of several model instances, showing the following features:
Further explanation of this example: elscb.mos, elsglobal.mos, runels.mos: Xpress Whitepaper 'Multiple models and parallel solving with Mosel', Section 'Solving several model instances in parallel'.
Source Files By clicking on a file name, a preview is opened at the bottom of this page. Data Files els.dat ! Data file for `els.mos' DEMAND: [ 2 3 5 3 4 2 5 4 1 3 4 2 3 5 2 3 1 2 3 5 3 1 2 3 3 4 5 1 4 1 3 5 2 1 2 1 3 3 5 2 2 1 3 2 3 2 2 1 3 2 1 2 2 3 3 2 2 3 1 2] SETUPCOST: [17 14 11 6 9 6 15 10 8 7 12 9 10 8 12] PRODCOST: [ 5 3 2 1 3 1 4 3 2 2 3 1 2 3 2 1 4 2 3 1 3 1 2 3 3 3 4 4 2 2 3 3 3 4 4 3 3 3 2 2 1 1 3 3 3 2 2 2 3 3 3 4 4 4 3 3 2 2 2 3] CAP: [12 12 12 12 12 12 12 12 12 12 12 12 12 12 12] | |||||||||
© Copyright 2024 Fair Isaac Corporation. |