Separable programming/duality approach to solving the multi-product Newsboy/Gardener Problem with linear constraints

9Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

The Gardener Problem is an extension of the multi-product Newsboy Problem with constraints. It deals with situations where not only the demand is random but also the yield (the supply). Separable programming and duality approaches are utilized to solve the constrained Newsboy/Gardener Problem. The solution methodologies are developed for the common probability distribution functions for the demand, and uniform distribution for the supply, rendering exact and approximate solutions to the problem. Numerical examples are given and when applicable, the performance of the developed approach is compared to those of existing works in this arena. The results reveal that the developed solution methods efficiently converge to the optimal or near optimum solutions. Also, a salient feature of the proposed methodologies is that they can utilize readily available commercial software to solve the considered problems. This feature facilitates the portability of the developed models to the classroom environment. © 2012 Elsevier Inc.

Cite

CITATION STYLE

APA

Abdel-Malek, L. L., & Otegbeye, M. (2013). Separable programming/duality approach to solving the multi-product Newsboy/Gardener Problem with linear constraints. Applied Mathematical Modelling, 37(6), 4497–4508. https://doi.org/10.1016/j.apm.2012.09.059

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