Optimal assortment with concave cost functions

DOI10.1080/00207728508926753MaRDI QIDQ3690586zbMATH OpenOpenAlexFDO

Authors Shu-Cherng Fang

Publication date 1985

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207728508926753

zbMATH Keywords

assortment problemgeneral concave cost functionsoptimal segmented policy

Mathematics Subject Classification ID

Integer programming (90C10) Convex programming (90C25) Dynamic programming (90C39)

Recommendations

• The Discrete Two-Dimensional Assortment Problem
• Optimal retail assortments for substitutable items purchased in sets
• Combinatorial assortment optimization
• A dynamic programming approach to solving the assortment planning problem with multiple quality levels
• Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand

Cites work

• A Deterministic Multi-Period Production Scheduling Model with Backlogging
• A few remarks on the assortment problem
• Dynamic version of the economic lot size model
• The Assortment Problem with Nonlinear Cost Functions
• The trim-loss and assortment problems: A survey

Cited in

(1)

• Exact and asymptotically exact solutions for a class of assortment problems

This page was built for publication: Optimal assortment with concave cost functions

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