Abstract
In this paper a class of dynamic resource allocation in a set of networks is treated. The paper is concerned with the construction of formal models of resource allocations under multiple objectives. We formalize the basic concepts of the partial resource exchange among networks, such as optimization of the partial resource exchange, singular resource points, Pareto optimal resource points. Theorems concerning resource exchanges are given, which provide a constructive way of deriving cooperative solution to resource allocation under multiple objectives.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Herroelen, W.S.: RESOURCE — CONSTRAINED PROJECT SCHEDULING — THE STATE OF THE ART, Opl. Res. Q. Vol. 23, pp. 261, (1973).
Woodgate, H.S.: PLANNING NETWORKS AND RESOURCE ALLOCATION, Datamation, Vol. 14, pp. 36, (1968).
Petrović R.: OPTIMIZATION OF RESOURCE ALLOCATION IN PROJECT PLANNING, Ops. Res. Vol. 16, pp. 259, (1968).
Petrović R.: THE COOPERATIVE SOLUTION OF MULTIPROJECT RESOURCE ALLOCATION IN PLANNING NETWORKS, Proc. V INTERNET, Birmingham, U,K. (1976).
Polterovich V.: BLOCK METHODS IN CONCAVE PROGRAMMING AND ITS ECONOMIC INTERPRETATION (in russian) Econ. and Math. Methods, Vol. 5, No. 2 (1969).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag
About this paper
Cite this paper
Petrović, R. (1978). Resource allocation in a set of networks under multiple objectives. In: Stoer, J. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006529
Download citation
DOI: https://doi.org/10.1007/BFb0006529
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08708-3
Online ISBN: 978-3-540-35890-9
eBook Packages: Springer Book Archive