An efficient method for joint product line selection and pricing with fixed costs

DOI10.1007/s11590-018-1356-5zbMath1422.91274OpenAlexW2901155189MaRDI QIDQ2414119

Jungju Park, Jeonghoon Mo

Publication date: 10 May 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1356-5

zbMATH Keywords

pricingconvex integer programmingfixed costproduct line selection

Mathematics Subject Classification ID

Convex programming (90C25) Microeconomic theory (price theory and economic markets) (91B24)

Related Items (1)

Product line optimization in the presence of preferences for compromise alternatives

Uses Software

• KNITRO

Cites Work

• Unnamed Item
• A branch-and-cut algorithm for the latent-class logit assortment problem
• On the product line selection problem under attraction choice models of consumer behavior
• Assortment Optimization Under Variants of the Nested Logit Model
• Multiproduct Price Optimization and Competition Under the Nested Logit Model with Product-Differentiated Price Sensitivities
• Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
• Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model
• On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
• Joint pricing, assortment, and inventory decisions for a retailer's product line

This page was built for publication: An efficient method for joint product line selection and pricing with fixed costs