A Note on Liu-iwamura's Dependent-Chance Programming
Loading...
Files
Date
2009
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier Science Bv
Open Access Color
BRONZE
Green Open Access
Yes
OpenAIRE Downloads
3
OpenAIRE Views
2
Publicly Funded
Yes
Abstract
Sometimes a complex stochastic decision system undertakes multiple tasks called events, and the decision-maker wishes to maximize the chance functions which are defined as the probabilities of satisfying these events. Originally introduced by Liu and Iwamura [B. Liu, K. Iwarnura, Modelling stochastic decision systems using dependent-chance programming, European journal of Operational Research 101 (1997) 193-203], dependent-chance programming is aimed at maximizing some chance functions of events in an uncertain environment. In this work. we show that the original dependent chance-programming framework needs to be extended in order to capture an exact reliability measure for a given plan. (C) 2008 Elsevier B.V. All rights reserved.
Description
Keywords
Inventory control, Integer programming, Constraint programming, Demand uncertainty, Demand uncertainty, Integer programming, Constraint programming, Inventory control, constraint programming, Inventory, storage, reservoirs, demand uncertainty, inventory control, integer programming
Fields of Science
0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 01 natural sciences
Citation
WoS Q
Q1
Scopus Q
Q1

OpenCitations Citation Count
3
Source
European Journal of Operatıonal Research
Volume
198
Issue
3
Start Page
983
End Page
986
PlumX Metrics
Citations
CrossRef : 2
Scopus : 4
Captures
Mendeley Readers : 18
SCOPUS™ Citations
4
checked on Mar 16, 2026
Web of Science™ Citations
3
checked on Mar 16, 2026
Page Views
1
checked on Mar 16, 2026
Downloads
5
checked on Mar 16, 2026
Google Scholar™


