Evaluating jointly constrained order quantity complexities for incremental discounts

详细信息    查看全文

• 作者：Rubin ; Paul A. ; Benton ; W.C.
• 关键词：Purchasing ; Inventory ; Pricing ; Quantity discounts ; Nonlinear programming
• 刊名：European Journal of Operational Research
• 出版年：2003
• 出版时间：September 16, 2003
• 年：2003
• 卷：149
• 期：3
• 页码：557-570
• 全文大小：221 K

文摘

In this paper we consider the purchasing decisions facing a buying firm which receives incrementally discounted price schedules for a group of items in the presence of constraints such as budgets and space limitations. The constraints take the form of upper bounds on positively weighted linear combinations of order size, dollar volume, unit price and order frequency. We adapt the solution procedures from an earlier paper [Naval Res. Logis. 40 (2) (1993) 255] to treat this case. The results show that simultaneous order quantities for multiple items, offered with separate incremental discounts and subject to joint resource constraints, can be calculated efficiently using a combination of Lagrangean relaxation and, as needed, partial enumeration. This problem proved to be no more and no less tractable than its counterpart with all units discounts.