Constrained optimization of a newsboy problem with return policy using KKT conditions and GA

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

Abstract

Information Management Department, St. John's University, Tamsui, Taipei, 25135, ROC A newsboy problem model in which a vendor has limited resource is developed. It is assumed that the supplier will either sell the items to the vendor outright or offer the items to the vendor with return policy. In the latter case, the supplier buys back at certain percentage of original cost from the vendor the unsold items at the end of the selling season. The purpose of this study is to investigate how the vendor should replenish the items with return policy, constrained resources and changing procured price. Three numerical examples are provided. In one example with two constrained variables, an optimal solution is derived by using KKT (Karush-Kuhn-Tucker) conditions. The other two multiple variables examples with a minimum service level or a limited budget are solved using GA (genetic algorithm). © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Yang, P. C., Wee, H. M., Chung, S. L., & Kang, S. H. (2007). Constrained optimization of a newsboy problem with return policy using KKT conditions and GA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4570 LNAI, pp. 227–237). Springer Verlag. https://doi.org/10.1007/978-3-540-73325-6_23

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