Sometimes we need more power to solve a model. This article describes how to solve a model using the CPLEX solver via the NEOS Server.
Page 24 of 35
We describe an example of how to represent price breaks in a linear programming model, built in Excel using Solver or OpenSolver.
We estimate the speed improvement for optimization solvers in the 35 years from 1989 to 2024. The results may be surprising.
A new role mining model is claimed to be more tractable and practical. We test that assertion using constraint programming and MILP.
We report our experience of Copilot coding a non-trivial optimization model, focussing on what went well and what didn't go well as the model evolves.
To compare optimization modelling in Excel and Python, we replicate a Python model then compare it with an equivalent Excel implementation.
We explore methods to decide the best order for positioning devices in a rack: enumerate, heuristic, constraint programming, and linear program.
We've collated links to dozens of websites about optimization modelling. The links are organized into several categories.
How many other optimal solutions exist? How do I find those solutions. This article explains how to use the CPLEX solution pool.
We minimize trim waste in a paper manufacturing process. A theoretically perfect solution is impractical, so what can we do?
We present an example of project crashing using an optimization model to help the project manager decide what to do.
We explore two aspects of refactoring an existing optimization model: Modularization and adding model variations.
Formulating logic conditions in linear programs can be difficult. This two-part article series explains how, using easy to follow steps.
