Lorenz Non-Dominated Points for Multi-Objective Knapsack Requirements Python 3.7+ NumPy Gurobi (with valid license) How to run: 1. Indirect: Dynamic Programming Finds one Lorenz-efficient solution. python lorenz_non_domines_indirecte.py 2. Direct: iterative_PL and enumerate_same_lorenz_p2 - Alternative Solutions Finds all Lorenz-efficient solutions. python P1Model.py