An Algorithm for Selecting Quantity Discounts from Realistic Schedules

DOI10.1057/JORS.1990.24MaRDI QIDQ3468852zbMATH OpenOpenAlexFDO

Authors Chandrasekhar Das

Publication date 1990

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1990.24

zbMATH Keywords

continuous optimumdiscontinuitiesinteger optimumquantity discountingroundingstopping rules

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Microeconomic theory (price theory and economic markets) (91B24)

Recommendations

• An efficient optimal algorithm for the quantity discount problem in material requirement planning
• A general quantity discount and supplier selection mixed integer programming model
• Evaluating jointly constrained order quantity complexities for incremental discounts.
• A generalized discount structure and some dominance rules for selecting the price-break EOQ
• Single‐period inventory models with demand uncertainty and quantity discounts: Behavioral implications and a new solution procedure

Cited in

(3)

• An efficient optimal algorithm for the quantity discount problem in material requirement planning
• All-units quantity-freight discounts with disposals
• Inventory Management: An Overview, Canadian Publications, Practical Applications and Suggestions for Future Research

This page was built for publication: An Algorithm for Selecting Quantity Discounts from Realistic Schedules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3468852)