An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand

DOI10.1007/S11081-013-9245-3MaRDI QIDQ2357249zbMATH OpenOpenAlexFDO

Authors Razieh Ghandali, Amir Ahmadi-Javid

Publication date 19 June 2017

Published in Optimization and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11081-013-9245-3

zbMATH Keywords

capacitated location-allocation problemdistribution networkintegrationLagrangian relaxation methodmixed-integer linear programmingprice-sensitive demandspricingsupply chain management

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Mixed integer programming (90C11)

Recommendations

• Incorporating location, inventory and price decisions into a supply chain distribution network design problem
• Designing a distribution network in a supply chain system: formulation and efficient solution procedure
• A Lagrangian-based solution algorithm for strategic supply chain distribution design in uncertain environment
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
• A profit-maximizing supply chain network design model with demand choice flexibility

Cites work

• A profit-maximizing supply chain network design model with demand choice flexibility
• A variable target value method for nondifferentiable optimization
• Competitive Location Models: A Framework and Bibliography
• Competitive location on networks under delivered pricing
• Convergence of a simple subgradient level method
• Facility location and supply chain management. A review
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 44281 (Why is no real title available?)
• scientific article; zbMATH DE number 1128836 (Why is no real title available?)
• scientific article; zbMATH DE number 3282977 (Why is no real title available?)
• Location analysis: a synthesis and survey
• Maximal covering location problem with price decision for revenue maximization in a competitive environment
• Nonlinear optimization.
• On a profit maximizing location model
• Profit-earning facility location
• Simple plant location under uniform delivered pricing
• Static competitive facility location: an overview of optimisation approaches.
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Uncapacitated Plant Location Under Alternative Spatial Price Policies
• Validation of subgradient optimization

Cited in

(10)

• A survey of healthcare facility location
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
• A multi-stage stochastic program for supply chain network redesign problem with price-dependent uncertain demands
• Integrated strategic and tactical supply chain planning with price-sensitive demands
• Incorporating location, inventory and price decisions into a supply chain distribution network design problem
• A robust stochastic possibilistic programming model for dynamic supply chain network design with pricing and technology selection decisions
• Facility location and pricing problem: discretized mill price and exact algorithms
• A location-inventory-pricing model for a three-level supply chain distribution network
• Designing a distribution network in a supply chain system: formulation and efficient solution procedure
• A profit-maximizing supply chain network design model with demand choice flexibility

This page was built for publication: An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand

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