Plant Assignment Optimization Using Mixed-Integer Programming | Descriptive & Diagnostic Analytics
Built a Generalized Assignment Problem (mixed-integer linear program) in Python (PuLP/CBC) to optimize plant-order routing across 9,215 real orders and 19 manufacturing plants; found a $146K (0.9%) cost-reduction opportunity while enforcing real capacity, product-eligibility, and contractual (VMI) constraints. Conducted Pareto/ABC concentration, delivery-performance, carrier scorecard, and capacity-utilization analysis using pandas and matplotlib, surfacing operational insights (e.g., 63% of volume concentrated in 5 of 46 customers) beyond the core optimization.
