Bounds on stochastic convex allocation problems

Chanaka Edirisinghe, Derek Atkins and Paul Iyogun

Applied Stochastic Models and Data Analysis, 1994, vol. 10, issue 2, 123-140

Abstract: We consider a stochastic convex program arising in a certain resource allocation problem. The uncertainty is in the demand for a resource which is to be allocated among several competing activities under convex inventory holding and shortage costs. The problem is cast as a two–period stochastic convex program and we derive tight upper and lower bounds to the problem using marginal distributions of the demands, which may be stochastically dependent. It turns out that these bounds are tighter than the usual bounds in the literature which are based on limited moment information of the underlying random variables. Numerical examples illustrate the bounds.

Date: 1994
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/asm.3150100206

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:apsmda:v:10:y:1994:i:2:p:123-140

Access Statistics for this article

More articles in Applied Stochastic Models and Data Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().