My Constraint Satisfaction lecture (https://www.youtube.com/watch?v=w5tPsbOvkmU https://www.youtube.com/watch?v=w5tPsbOvkmU) may help, though I will say it only

My Constraint Satisfaction lecture (https://www.youtube.com/watch?v=w5tPsbOvkmU https://www.youtube.com/watch?v=w5tPsbOvkmU) may help, though I will say it only serves as a light 75 minute overview of constraints. Specifically in the second half of the lecture I use girl scout cookies and scooters to try and explain Linear Programming. A quick Googling pulled up a Linear Programming Using Excel tutorial: https://science.utm.my/procscimath/wp-content/uploads/sites/605/2021/10/222-231-NorFaiezzatieShahiraBintiMohamad_OngCheeTiong.pdf https://science.utm.my/procscimath/wp-content/uploads/sites/... This type of problem was what helped me understand the optimizations. I haven't studied the inner workings of the Simplex method, but it is used in Excel's Solver as well as Apache Commons'. While it is still computer science oriented, I also like Grokking Algorithms (https://www.manning.com/books/grokking-algorithms https://www.manning.com/books/grokking-algorithms). I used it as a source when I was building out some examples when I was teaching Algorithmic analysis and data structures. It does a great job of distilling the problems into a beginner friendly way that will lead you to dig into "what libraries are out there that have implemented this?"