Allocating procurement to capacitated suppliers with concave quantity discounts
From MaRDI portal
Publication:924901
DOI10.1016/j.orl.2007.04.001zbMath1165.90601OpenAlexW1989953059MaRDI QIDQ924901
Joseph Geunes, Gerard J. Burke, H. Edwin Romeijn, Asoo J. Vakharia
Publication date: 29 May 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2007.04.001
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
Solving knapsack problems with \(S\)-curve return functions ⋮ A continuous knapsack problem with separable convex utilities: approximation algorithms and applications ⋮ The newsvendor problem with capacitated suppliers and quantity discounts ⋮ Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ/h Rule ⋮ Incorporating quantity discounts and their inventory impacts into the centralized purchasing decision ⋮ Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization
Cites Work
- Vendor selection criteria and methods
- Constrained global optimization: algorithms and applications
- A classification of literature on determining the lot size under quantity discounts
- The nonlinear knapsack problem - algorithms and applications
- The concave cost supply problem.
- On the solution of concave knapsack problems
- Heuristics for sourcing from multiple suppliers with alternative quantity discounts
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- Methods for Global Concave Minimization: A Bibliographic Survey
- On optimality conditions in nondifferentiable programming
- Channel Coordination and Quantity Discounts
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
This page was built for publication: Allocating procurement to capacitated suppliers with concave quantity discounts
