Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions

DOI10.1016/j.ejor.2005.09.046zbMath1103.90019OpenAlexW2027945399MaRDI QIDQ852959

Julie A. Niederhoff

Publication date: 15 November 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.046

zbMATH Keywords

productioninventoryconvex programmingconstraint satisfactionnewsvendor problem

Mathematics Subject Classification ID

Convex programming (90C25) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (11)

Effects of gift cards on optimal order and discount of seasonal products ⋮ Robust multi-product inventory optimization under support vector clustering-based data-driven demand uncertainty set ⋮ Optimal decision making in multi-product dual sourcing procurement with demand forecast updating ⋮ Integrated decision making model for pricing and locating the customer order decoupling point of a newsvendor supply chain ⋮ Jointly pricing and ordering for a multi-product multi-constraint newsvendor problem with supplier quantity discounts ⋮ Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints ⋮ A constructive methodology to solving the capacitated newsvendor problem: an approximate approach ⋮ Supply Allocation Under Sequential Advance Demand Information ⋮ The multi-product newsboy problem with supplier quantity discounts and a budget constraint ⋮ Optimal inventory decisions for a risk-averse retailer when offering layaway ⋮ Multi-product newsboy problem with limited capacity and outsourcing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The newsstand problem: A capacitated multiple-product single-period inventory problem
• Multi-resource investment strategies: Operational hedging under demand uncertainty
• Algorithms for Separable Nonlinear Resource Allocation Problems
• Investment Strategies for Flexible Resources
• Practical Piecewise-Linear Approximation for Monotropic Optimization
• Two-Segment Separable Programming
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• The Distribution Free Newsboy Problem: Review and Extensions
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems

This page was built for publication: Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions