Bin packing is a common optimization problem. A new formulation helps us solve a simple, yet difficult to solve, bin packing model.
We run optimization model cases 10 times faster, fully using the parallel capabilities of the CPU cores/threads in a modern computer.
Given available resources, what mix of products will maximize profit? We can answer to question using Excel and the Solver add-in.
We compare a linear programming model written using Julia/JuMP with the same model written using Python/Pyomo.
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.
We've collated links to dozens of websites about optimization modelling. The links are organized into several categories.
We minimize the number of racks required to accommodate all pallets in a warehouse, freeing space for other activities and allowing company growth.
This series explores optimization of a "picking warehouse" by improving the warehouse design and efficiency of the picking process.
