Hard Constraints, Smooth Gradients: Learning Feasible Inventory Policies via Differentiable Projection.

arXiv:2608.02343v2 Announce Type: replace Abstract: Many operational problems are constrained sequential decision processes with combinatorial action spaces and interdependent constraints. Mixed-integer linear programs (MILPs) handle such constraints flexibly