Solver Max - Diet in SciPy

Dinner

Description: Select foods that satisfy daily nutritional requirements at minimum cost.
Category: Diet.
Type: LP.
Library: SciPy.
Solver: HiGHS.

Notes:

The data has been extracted into a separate file.
Method changed from 'simplex' (legacy) to use HiGHS solver.

GitHub: Diet in SciPy.

Python
SciPy

Essential reading

We minimize trim waste in a paper manufacturing process. A theoretically perfect solution is impractical, so what can we do?
Using the SciPy library, we find an optimal solution to Aryabhata's approximation of trigonometric functions using ratios of quadratic polynomials.
Given available resources, what mix of products will maximize profit? We can answer to question using Excel and the Solver add-in.
Given available stock of wire and a list of pieces required, what is the best way to cut the stock to fulfil demand while minimizing waste?
We run optimization model cases 10 times faster, fully using the parallel capabilities of the CPU cores/threads in a modern computer.
Minimize the number of racks to store all pallets in a warehouse, freeing space for other activities and allowing company growth.
A new role mining model is claimed to be more tractable and practical. We test that assertion using constraint programming and MILP.
We explore two aspects of refactoring an existing optimization model: Modularization and adding model variations.
We describe an example of how to represent price breaks in a linear programming model, built in Excel using Solver or OpenSolver.
We compare a linear programming model written using Julia/JuMP with the same model written using Python/Pyomo.
We estimate the speed improvement for optimization solvers in the 35 years from 1989 to 2024. The results may be surprising.
Academic research papers can be tremendously valuable. But only if they are complete. So, academics, please publish your data and code.

Latest blog articles

Latest resources

Featured