IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-81-322-1901-9_5.html
   My bibliography  Save this book chapter

Network Models

In: Strategic Business Decisions

Author

Listed:
  • R. Srinivasan

    (Indian Institute of Science)

Abstract

The term network flow program describes a type of model that is a special case of the more general linear program. The class of network flow programs includes such problems as the transportation problem, the assignment problem, the shortest path problem, and maximum flow problem. Many aspects of actual situations are readily recognized as networks, and the representation of the network model is much more compact than the general linear program. When a situation can be entirely modeled as a network, very efficient algorithms exist for the solution of the optimization problem, many times more efficient than linear programming in the utilization of computer time and space resources. In this chapter, we would introduce the reader to important day-to-day techniques such as critical path method (CPM) and project evaluation and review technique (PERT) and also to the maximum spanning tree algorithm. By the end of the chapter, the reader will be able to: (1) Construct a network chart or diagram from a givens set of activity data points. (2) Identify the critical paths, floats, and slacks in the network. (3) Crash activities and alter the total duration of the project.

Suggested Citation

  • R. Srinivasan, 2014. "Network Models," Springer Books, in: Strategic Business Decisions, edition 127, chapter 0, pages 139-162, Springer.
    • Handle: RePEc:spr:sprchp:978-81-322-1901-9_5
    DOI: 10.1007/978-81-322-1901-9_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-81-322-1901-9_5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.