Abstract
Until now, when we have been dealing with linear programming, we have always assumed that the constants in the objective function, and those in the constraints, were precisely known. In many practical applications this is not so. We shall now consider cases where the constant terms in the constraints are not precisely known; we know only their probability distributions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1981 S. Vajda
About this chapter
Cite this chapter
Vajda, S. (1981). Linear programming under uncertainty. In: Linear Programming. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-6924-0_7
Download citation
DOI: https://doi.org/10.1007/978-94-011-6924-0_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-0-412-16430-9
Online ISBN: 978-94-011-6924-0
eBook Packages: Springer Book Archive