A curated collection of mathematical-optimization models written in GAMS for operations research and industrial-engineering study.
| Area | Model | Type | Documentation | License status |
|---|---|---|---|---|
| Cutting stock | CSP.gms |
LP | Guide | MIT |
| Facility location | OptimalLocationFinder.gms |
LP | Guide | MIT |
| Bootcamp exercises | Exercise index | LP, MILP, NLP, MINLP, multi-objective | Section index | Excluded |
Install a current version of GAMS with a solver suitable for the model, then run from the model's directory:
gams CSP.gmsGAMS Studio can also open and run each .gms file. Solver availability and
problem-size limits depend on the local GAMS installation and license.
Generated .log, .lst, .lxi, and restart files are intentionally
ignored. They include machine-specific paths and solver metadata and should be
regenerated locally rather than committed.
- Original models have dedicated explanations of formulation, inputs, assumptions, execution, and interpretation.
- Bootcamp exercises are separated by model family and clearly excluded from the repository's MIT grant.
- Path names are kept Windows-compatible so the complete repository can be cloned across supported desktop platforms.
These models are educational examples. Validate units, data, solver status, optimality gaps, and business constraints before using any result in an operational decision.
Original work is available under the MIT License. Read
LICENSE_SCOPE.md for the exact boundary; course-derived
exercises and their data are excluded.