Showing 81 - 90 of 1,385
Persistent link: https://www.econbiz.de/10011993590
Persistent link: https://www.econbiz.de/10011869094
Three concepts combine to show both the feasibility and desirability of incorporating probability within programming models. First, the reliability of estimates obtained by using Chebyshev's inequality increases as variation measured by the coefficient of variation, declines. Second, the...
Persistent link: https://www.econbiz.de/10010879232
The transition to sustainable food supply chain management has brought new key logistical aims such as reducing food waste and environmental impacts of operations in the supply chain besides the traditional cost minimization objective. Traditional assumptions of constant distribution costs...
Persistent link: https://www.econbiz.de/10011263685
Jagannathan's (Jagannathan, R. 1985. Use of sample information in stochastic recourse and chance-constrained programming models. Management Sci. 31 96--108.) invocation of a utility function for a chance-constrained programming problem [CCPP] produces a Bayesian utility maximation problem [BUMP]...
Persistent link: https://www.econbiz.de/10009214131
The issue of equivalence between chance-constrained programming problems (CCPP's) and Bayesian utility-maximization problems (BUMP's), and the anomalous evaluation of information in CCPP's, are re-examined in light of a recent paper by Jagannathan and the ensuing exchange between Jagannathan and...
Persistent link: https://www.econbiz.de/10009214304
This paper applies the replacement cost method for calculating the value of stochastic carbon sequestration in the EU climate policy for mitigating carbon dioxide emissions. Minimum costs with and without carbon sequestrations are then derived with a safety-first approach in a chance-constrained...
Persistent link: https://www.econbiz.de/10010611612
Persistent link: https://www.econbiz.de/10010865594
In this paper, we consider a class of two-stage stochastic optimization problems arising in the protection of vital arcs in a critical path network. A project is completed after a series of dependent tasks are all finished. We analyze a problem in which task finishing times are uncertain but can...
Persistent link: https://www.econbiz.de/10009208694
Persistent link: https://www.econbiz.de/10013362588