This repository contains typical examples of linear programming problems solved using the PuLP library in Python, along with Marimo for Markdown outputs and interactivity.
- TSP (Traveling Salesman Problem): Finding the shortest possible route that visits each city exactly once and returns to the origin city.
- SPP (Shortest Path Problem): Determining the shortest path between two nodes in a weighted graph. Contains variations with baseline path, path with refuelling nodes, and minimax path under bad conditions.
- WLP (Warehouse Location Problem): Optimizing the placement of warehouses to minimize costs, considering weighting parameter Alpha.
- SSP (Secret Santa Problem): Assigning gift exchanges among participants while adhering to specific constraints.