An extended algorithm for capacitated multiple item ordering with quantity discounts

Previosly a heuristic algorithm was developed for determining order quantities for multiple items given all-units quantity discounts and a single resource constraint. This short communication extends this Lagrangean relaxation approach to provide improved solutions. Examples and computational results are presented that compare solutions from the original algorithm with those from the extended algorithm, as well as with optimal solutions.