Skip to main content

Cost Minimization for STEOR and EOR Networks

  • Chapter
Stochastic Project Networks

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 344))

  • 310 Accesses

Abstract

In this chapter we consider the case where different types of cost are incurred by the execution of activities and the occurrence of events of a project modelled by a STEOR network. We will see that the expected total cost of the project depends only on the activation functions Yj of the individual nodes j of the network. Since the activation function Yj of any node j in an admissible EOR network N coincides with the activation function of node j in each STEOR network from a covering of N that contains all nodes from S(j) and all arcs joining those nodes (cf. (3.5.10)), the cost minimization problem for admissible EOR networks of Markov degree d >1 can be solved in the same manner as for STEOR networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Neumann, K. (1990). Cost Minimization for STEOR and EOR Networks. In: Stochastic Project Networks. Lecture Notes in Economics and Mathematical Systems, vol 344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61515-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-61515-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52664-3

  • Online ISBN: 978-3-642-61515-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics