Capacitated Multiple Item Ordering Problem with Quantity Discounts
- 1 September 1985
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 17 (3) , 206-211
- https://doi.org/10.1080/07408178508975295
Abstract
Purchasing managers face a complex problem when determining order quantities for multiple items in the presence of quantity discounts and resource limitations. In this paper, the problem is formulated as a mathematical programming model. An efficient solution algorithm is developed utilizing the Lagrangian relaxation approach. Extensive computational experiments are performed and the results are presented.Keywords
This publication has 11 references indexed in Scilit:
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimalityMathematical Programming, 1985
- TOTAL SETUP LOT SIZING WITH QUANTITY DISCOUNTS*Decision Sciences, 1982
- Database Location in Computer NetworksJournal of the ACM, 1980
- On obtaining the ‘best’ multipliers for a lagrangean relaxation for integer programmingComputers & Operations Research, 1978
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- Lagrangean Relaxation Applied to Capacitated Facility Location ProblemsA I I E Transactions, 1978
- Validation of subgradient optimizationMathematical Programming, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of ResourcesOperations Research, 1963