|Gilmore-Gomory column generation procedure for the cutting-stock (roll trim) problem|
|Same as cut1.run, but using an alternative arrangement wherein problems are defined immediately before before their members are declared|
|Same as cut1.run, but with better formatting of output|
|Dantzig-Wolfe decomposition for a multi-commodity transportation problem, using a single subproblem|
|Same as multi1.run, but using the same repeat loop for both phase I (infeasible) and phase II (feasible).|
|Same as multi1.run, but using a separate subproblem for each product; subproblems are represented in AMPL by an indexed collection of named problems|
|Same as multi2.run, except that the separate subproblems are realized by changing the data to a single AMPL named problem|
|Benders decomposition for a stochastic programming variant of a multi-period production problem (see Exercise 4-5)|
|Same as stoch1.run, but using a separate subproblem for each scenario; subproblems are represented in AMPL by an indexed collection of named problems|
|Same as stoch2.run, except that the separate subproblems are realized by changing the data to a single AMPL named problem|
|Benders decomposition for a location-transportation problem (original model in trnloc.mod)|
|Lagrangian relaxation for a location-transportation problem: LP relaxation bound is poor, and subproblem has the integrality property so no improvement can be made|
|Same as trnloc2a.run, but model has upper limits on the Ship variables: LP relaxation bound is still poor, but subproblem does not have the integrality property and considerable improvement is made|
|Same as trnloc2b.run, but model has 0-1 constraints disaggregated: LP relaxation bound is good, but subproblem has the integrality property and no further improvement can be made|
Return to the AMPL update page.
Return to the AMPL home page.