American Institute of Mathematical Sciences

Advanced
January  2007, 3(1): 87-98. doi: 10.3934/jimo.2007.3.87

Capacitated requirements planning with pricing flexibility and general cost and revenue functions

F. Zeyenp Sargut 1, and  H. Edwin Romeijn 1,

1. 

Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611, United States, United States

Received  June 2005 Published  January 2007

The requirements problem with pricing flexibility generalizes the standard economic lot-sizing problem by recognizing that the demand for a good can often be influenced by adjusting its price level. This naturally leads to a profit maximization model that integrates price setting as well as production and inventory management. In this paper, we consider the NP-hard problem that arises in the presence of general cost functions as well as time-varying production capacities. We study a reformulation of the problem as an economic lot-sizing problem and use this reformulation to derive running times for dynamic programming and approximation algorithms for the requirements planning problem.
Keywords: dynamic programming, approximation scheme., Pricing, lot-sizing.
Mathematics Subject Classification: Primary: 90B30; Secondary: 90.
Citation: F. Zeyenp Sargut, H. Edwin Romeijn. Capacitated requirements planning with pricing flexibility and general cost and revenue functions. Journal of Industrial & Management Optimization, 2007, 3 (1) : 87-98. doi: 10.3934/jimo.2007.3.87
[1]

Onur Kaya, Halit Bayer. Pricing and lot-sizing decisions for perishable products when demand changes by freshness. Journal of Industrial & Management Optimization, 2021, 17 (6) : 3113-3129. doi: 10.3934/jimo.2020110
[2]

Pedro Piñeyro, Omar Viera. Inventory policies for the economic lot-sizing problem with remanufacturing and final disposal options. Journal of Industrial & Management Optimization, 2009, 5 (2) : 217-238. doi: 10.3934/jimo.2009.5.217
[3]

Lalida Deeratanasrikul, Shinji Mizuno. Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: A case study in the wheel industry. Journal of Industrial & Management Optimization, 2017, 13 (1) : 413-428. doi: 10.3934/jimo.2016024
[4]

Sumon Sarkar, Bibhas C. Giri. Optimal lot-sizing policy for a failure prone production system with investment in process quality improvement and lead time variance reduction. Journal of Industrial & Management Optimization, 2021  doi: 10.3934/jimo.2021048
[5]

Min Tang, Fuying Jing, Xiangrui Chao. A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities. Journal of Industrial & Management Optimization, 2020, 16 (5) : 2389-2406. doi: 10.3934/jimo.2019059
[6]

Andrzej Nowakowski, Jan Sokolowski. On dual dynamic programming in shape control. Communications on Pure & Applied Analysis, 2012, 11 (6) : 2473-2485. doi: 10.3934/cpaa.2012.11.2473
[7]

Jérôme Renault. General limit value in dynamic programming. Journal of Dynamics & Games, 2014, 1 (3) : 471-484. doi: 10.3934/jdg.2014.1.471
[8]

Fuying Jing, Zirui Lan, Yang Pan. Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities. Journal of Industrial & Management Optimization, 2020, 16 (3) : 1435-1456. doi: 10.3934/jimo.2019010
[9]

Oliver Junge, Alex Schreiber. Dynamic programming using radial basis functions. Discrete & Continuous Dynamical Systems, 2015, 35 (9) : 4439-4453. doi: 10.3934/dcds.2015.35.4439
[10]

Eduardo Espinosa-Avila, Pablo Padilla Longoria, Francisco Hernández-Quiroz. Game theory and dynamic programming in alternate games. Journal of Dynamics & Games, 2017, 4 (3) : 205-216. doi: 10.3934/jdg.2017013
[11]

Rein Luus. Optimal control of oscillatory systems by iterative dynamic programming. Journal of Industrial & Management Optimization, 2008, 4 (1) : 1-15. doi: 10.3934/jimo.2008.4.1
[12]

Qing Liu, Armin Schikorra. General existence of solutions to dynamic programming equations. Communications on Pure & Applied Analysis, 2015, 14 (1) : 167-184. doi: 10.3934/cpaa.2015.14.167
[13]

Rhoda P. Agdeppa, Nobuo Yamashita, Masao Fukushima. An implicit programming approach for the road pricing problem with nonadditive route costs. Journal of Industrial & Management Optimization, 2008, 4 (1) : 183-197. doi: 10.3934/jimo.2008.4.183
[14]

P. K. Jha, R. Lipton. Finite element approximation of nonlocal dynamic fracture models. Discrete & Continuous Dynamical Systems - B, 2021, 26 (3) : 1675-1710. doi: 10.3934/dcdsb.2020178
[15]

Haiying Liu, Xinxing Luo, Wenjie Bi, Yueming Man, Kok Lay Teo. Dynamic pricing of network goods in duopoly markets with boundedly rational consumers. Journal of Industrial & Management Optimization, 2017, 13 (1) : 429-447. doi: 10.3934/jimo.2016025
[16]

Shichen Zhang, Jianxiong Zhang, Jiang Shen, Wansheng Tang. A joint dynamic pricing and production model with asymmetric reference price effect. Journal of Industrial & Management Optimization, 2019, 15 (2) : 667-688. doi: 10.3934/jimo.2018064
[17]

Kun Fan, Yang Shen, Tak Kuen Siu, Rongming Wang. On a Markov chain approximation method for option pricing with regime switching. Journal of Industrial & Management Optimization, 2016, 12 (2) : 529-541. doi: 10.3934/jimo.2016.12.529
[18]

Mohammed Abdelghany, Amr B. Eltawil, Zakaria Yahia, Kazuhide Nakata. A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem. Journal of Industrial & Management Optimization, 2021, 17 (4) : 2051-2072. doi: 10.3934/jimo.2020058
[19]

Tengfei Yan, Qunying Liu, Bowen Dou, Qing Li, Bowen Li. An adaptive dynamic programming method for torque ripple minimization of PMSM. Journal of Industrial & Management Optimization, 2021, 17 (2) : 827-839. doi: 10.3934/jimo.2019136
[20]

Ryan Loxton, Qun Lin. Optimal fleet composition via dynamic programming and golden section search. Journal of Industrial & Management Optimization, 2011, 7 (4) : 875-890. doi: 10.3934/jimo.2011.7.875

2020 Impact Factor: 1.801

Tools

Metrics

  • PDF downloads (31)
  • HTML views (0)
  • Cited by (0)

Other articles
by authors

[Back to Top]

Copyright © 2021 American Institute of Mathematical Sciences | Privacy Policy