A computational study of single constrained EOQ inventory systems

Tight bounds to the optimal Lagrange multiplier for two item deterministic inventory system with limited capacity are developed and compared to the most well known bounding procedure. A recursive process which rapidly converges to the optimal multiplier based on successive improvements of these bounds is also presented. Finally, this bounding process is extended to the case of item deterministic inventory systems.