2026-01-14

Name: Albert Sund Aillet

Project: Diet Optimization

Links:


I am here to present my Obscure side-project:


The side project I built:


It uses the following parts:

I had to look a lot into the data and do a few SQL joins.


What is the optimization problem: Linear programming, scipy formulation.

(Sorry for latex messing up, I will fix it later)

$$ \begin{align*} \min_{x} \quad & c^T x \\ \text{such that} \quad & A_{ub} x \leq b_{ub}, \\ %& A_{eq} x = b_{eq}, \\ & l \leq x \leq u, \end{align*} $$

Where in our case:


This can be solved quickly and efficiently with many out of the box solvers. In my benchmarking, since the problem is not sparse, the revised simplex method was the fastest.

The optimal solution is global.


The following features are available:


Technology used (very simple):

How I deploy:


Obscure side project that I thought about during my studies and then thought it would be easy and straightforward to finish in a few evenings.