Network Models

R. Srinivasan ()
Additional contact information
R. Srinivasan: Indian Institute of Science

Chapter Chapter 5 in Strategic Business Decisions, 2014, pp 139-162 from Springer

Abstract: 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.

Keywords: Network model; PERT; CPM; Maximum spanning tree; Time estimates; Float; Slack; Crashing; Kruskal’s method (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-81-322-1901-9_5

Ordering information: This item can be ordered from
http://www.springer.com/9788132219019

DOI: 10.1007/978-81-322-1901-9_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().