Title
Chance-Constrained Generalized Networks
Abstract
<P>An extension to the theory of linear programming over generalized networks is presented which replaces the generalized Kirchoff node conditions by chance constraints. The extension is motivated by a class of problems in sanitary and chemical engineering in which the nonzero entries in the generalized incidence matrix may be random variables. Duality relations are established for appropriate pairs of such chance-constrained programming problems by showing that their deterministic equivalents consist of a deterministic generalized network problem and its dual. It is also shown how these duality relations may be exploited in order to obtain actual solutions to chance-constrained generalized network problems.</P>
Year
DOI
Venue
1966
10.1287/opre.14.6.1113
Operations Research
Keywords
Field
DocType
linear programming,chemical properties,management,systems engineering
Mathematical optimization,Random variable,Generalized linear array model,Duality (optimization),Linear programming,Generalized linear mixed model,Mathematics,Incidence matrix
Journal
Volume
Issue
ISSN
14
6
0030-364X
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
A. Charnes1271145.50
M. Kirby211.05
W. Raike3157.78