Optimal lot sizing and algorithm for dynamic pricing under random yield and demand

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The literature under random component yield has focused on coordination of supply chain at the determined price, where decision maker chooses its optimal production quantities. We consider a centralized system when the price is not determined under both random yield and demand. Type A with perfect quality and type B with imperfect quality are produced due to the random yield. We prove the unique concavity of expected profit in centralized system at determined price. Then dynamic pricing is considered and algorithm is put forward for dynamic pricing. Errors can be sufficiently small as long as some parameters can be set suitably. Apart from lot sizing and dynamic pricing, we also provide qualitative insights based on numerical illustration of centralized and decentralized solutions. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Li, G., Ma, S., & Chou, W. (2009). Optimal lot sizing and algorithm for dynamic pricing under random yield and demand. Studies in Computational Intelligence, 214, 139–145. https://doi.org/10.1007/978-3-540-92814-0_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free